NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	408 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	2ms	324 KiB
#11	Accepted 5	4ms	532 KiB
#12	Accepted 5	40ms	1.9 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	408 KiB
#15	Accepted 5	35ms	1.8 MiB
#16	Accepted 5	15ms	916 KiB
#17	Accepted 5	2ms	408 KiB
#18	Accepted 5	4ms	404 KiB
#19	Accepted 5	39ms	1.9 MiB
#20	Accepted 5	20ms	1 MiB

#include<bits/stdc++.h>
#define int long long
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int rd() {int x=0,f=1;char c=getchar();while(!isdigit(c))f=c=='-'?-1:f,c=getchar();while(isdigit(c))x=x*10+(c^48),c=getchar();return x*f;}
const int N=100005,mod=1e9+7;
int qp(int a,int k) {int r=1;for(;k;k>>=1,a=a*a%mod)if(k&1)r=r*a%mod;return r;}
int n,m,k;
struct node {int p,x;}a[N];
bool operator<(node a,node b){return a.p<b.p;}
bool operator==(node a,node b) {return a.p==b.p;}
void Main() {
    n=rd(),m=rd(),k=rd();
    rep(i,1,m) a[i].p=rd(),a[i].x=rd();
    sort(a+1,a+1+m);
    rep(i,1,m-1) if(a[i].p==a[i+1].p&&a[i].x!=a[i+1].x) {
        puts("0");
        return;
    }
    m=unique(a+1,a+1+m)-a-1;
    int ans=qp(k,2*(a[1].p-1));
    rep(i,1,m-1) {
        int d=a[i+1].p-a[i].p;
        (ans*=qp(k,2*d)-qp(k,d-1)*(k-1)%mod)%=mod;
    }
    (ans*=qp(k,2*(n-a[m].p)))%=mod;
    printf("%lld\n",(ans+mod)%mod);
}
signed main() {
    freopen("assign.in","r",stdin);
    freopen("assign.out","w",stdout);
    int T=rd();
    while(T--) Main();
    return 0;
}
//g++ -std=c++14 -O2 -Wall -fsanitize=address,undefined -o assign assign.cpp

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

分数: 100
总耗时: 176ms
峰值时间: 40ms
峰值内存: 1.9 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录