NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	320 KiB
#4	Accepted 5	1ms	408 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	1ms	408 KiB
#8	Accepted 5	1ms	408 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	2ms	448 KiB
#11	Accepted 5	3ms	916 KiB
#12	Accepted 5	24ms	3.1 MiB
#13	Accepted 5	2ms	396 KiB
#14	Accepted 5	3ms	532 KiB
#15	Accepted 5	34ms	2.9 MiB
#16	Accepted 5	14ms	1.3 MiB
#17	Accepted 5	2ms	408 KiB
#18	Accepted 5	3ms	532 KiB
#19	Accepted 5	34ms	3.3 MiB
#20	Accepted 5	18ms	2.1 MiB

#include<cstdio>
#include<algorithm>
char buf[1<<21],*p1=buf,*p2=buf;
inline char Getc(){if(p1==p2){p2=(p1=buf)+fread(buf,1,1<<21,stdin);if(p1==p2) return EOF;}return *p1++;}
inline int rd()
{
	static char ch;
	while(ch=Getc(),ch<'0'||ch>'9');
	int x=ch^'0';
	while(ch=Getc(),'0'<=ch&&ch<='9') x=(x<<1)+(x<<3)+(ch^'0');
	return x;
}
typedef long long ll;
const int N=100010;
const int MOD=int(1e9)+7;
inline ll ksm(ll b,int p)
{
	ll r=1;
	for(;p;p>>=1,b=b*b%MOD) if(p&1) r=r*b%MOD;
	return r;
}
struct Node
{
	int pos,val;
	inline bool operator < (const Node &x)const {return pos<x.pos;}
}a[N];
int main()
{
	freopen("assign.in","r",stdin);
	freopen("assign.out","w",stdout);
	int T=rd();
	while(T--)
	{
		int n=rd(),m=rd(),v=rd();
		for(int i=1;i<=m;++i) a[i].pos=rd(),a[i].val=rd();
		std::sort(a+1,a+m+1);
		bool flag=true;
		int ans=1,lst=0;
		for(int i=1;i<=m;)
		{
			 int j=i;
			 while(j<m&&a[j+1].pos==a[i].pos) ++j;
			 if(!lst) ans=(ll)ans*ksm(v,(a[i].pos-1)*2)%MOD;
			 else ans=(ll)ans*(ksm(v,(a[i].pos-lst)*2)+MOD-(ll)ksm(v,a[i].pos-lst-1)*(v-1)%MOD)%MOD;
			 lst=a[i].pos;
			 for(;i<=j;++i) if(a[j].val!=a[i].val) flag=false;;
		}
		ans=(ll)ans*ksm(v,(n-lst)*2)%MOD;
		printf("%d\n",flag?ans:0);
	}
	return 0;
}

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

分数: 100
总耗时: 149ms
峰值时间: 34ms
峰值内存: 3.3 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录