NOI批量评测 - 记录详情

foo.cc: In function 'long long int qread()':
foo.cc:25:18: warning: 'o' is used uninitialized [-Wuninitialized]
   25 |     for(;!isdigit(o);o=getchar())if(f=='-')f=-1;
      |           ~~~~~~~^~~
foo.cc:24:10: note: 'o' was declared here
   24 |     char o;int f=1,x=0;
      |          ^
foo.cc: In function 'void qwrite(long long int)':
foo.cc:29:6: warning: infinite recursion detected [-Winfinite-recursion]
   29 | void qwrite(int x){
      |      ^~~~~~
foo.cc:31:11: note: recursive call
   31 |     qwrite(x/10);putchar(x%10+'0');
      |     ~~~~~~^~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	320 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	320 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	324 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	1ms	316 KiB
#11	Accepted 5	4ms	532 KiB
#12	Accepted 5	42ms	1.9 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	404 KiB
#15	Accepted 5	36ms	1.8 MiB
#16	Accepted 5	14ms	916 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	3ms	404 KiB
#19	Accepted 5	38ms	1.8 MiB
#20	Accepted 5	19ms	1 MiB

#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define int long long
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pbI push_back
#define inf 1e9//to lim
#define lowbit(x) x&(-x)
#define MOD 1000000007
#define mdI int mid=(l+r)>>1
#define MAXN 100010
//#define gint __int128
#define rep(a,b,c) for(int a=b;a<=c;a++)
bool FLA;
void chmx(int &x,int y){x=max(x,y);}
void chmi(int &x,int y){x=min(x,y);}
int qread(){
    char o;int f=1,x=0;
    for(;!isdigit(o);o=getchar())if(f=='-')f=-1;
    for(;isdigit(o);o=getchar())x=x*10+o-'0';
    return f*x;
}
void qwrite(int x){
    if(x<10)putchar(x+'0');
    qwrite(x/10);putchar(x%10+'0');
}
ll qp(ll a,ll b,ll p=MOD){
    ll bs=a,rs=1;while(b){if(b&1)rs=rs*bs%p;bs=bs*bs%p;b>>=1;}return rs;
}
int T,n,m,v;
pii cons[MAXN];
bool FLB;
signed main(){
    //cerr<<"A"<<endl;
    freopen("assign.in","r",stdin);
    freopen("assign.out","w",stdout);
    cin>>T;
    while(T--){
        cin>>n>>m>>v;
        rep(i,1,m){cons[i].fi=qread();cons[i].se=qread();}
        sort(cons+1,cons+1+m);
        int M=unique(cons+1,cons+1+m)-cons-1;
        ll ans=qp(v,2*(cons[1].fi-1));
        rep(i,2,M){
            if(cons[i].fi==cons[i-1].fi){ans=0;break;}
            int di=cons[i].fi-cons[i-1].fi;
            if(di!=1)
            ans=ans*((qp(v,2*di)-(qp(v,di-1)*(v-1))%MOD+MOD)%MOD)%MOD;
            else
                ans=ans*(v*v%MOD-v+1)%MOD;
            ans=(ans+MOD)%MOD;
        }
        ans=ans*qp(v,2*(n-cons[M].fi))%MOD;
        printf("%lld\n",ans%MOD);
    }
}
/*
minus useless chain
*/

递交者: JS-0616
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 JS】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.7 KiB
递交时间: 2024-12-6 17:47:15
评测时间: 2024-12-6 17:47:16

分数: 100
总耗时: 174ms
峰值时间: 42ms
峰值内存: 1.9 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录