NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	408 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	1ms	324 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	1ms	324 KiB
#11	Accepted 5	4ms	404 KiB
#12	Accepted 5	42ms	1.1 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	508 KiB
#15	Accepted 5	35ms	1 MiB
#16	Accepted 5	14ms	660 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	4ms	448 KiB
#19	Accepted 5	38ms	1.1 MiB
#20	Accepted 5	19ms	784 KiB

#include<bits/stdc++.h>
using namespace std;
namespace estidi{
	struct num{
		int id,v;
	}a[100003];
	bool operator < (num a,num b){
		return a.id<b.id;
	}
	long long pow(long long a,long long b,long long p){
		long long ans=1;
		while(b){
			if(b&1){
				ans*=a;
				ans%=p;
			}
			a*=a;
			a%=p;
			b>>=1;
		}
		return ans;
	}
	int read(){
		char c;
		int x;
		while(1){
			c=getchar();
			if(c>='0'&&c<='9')
				break;
		}
		x=c-'0';
		while(1){
			c=getchar();
			if(c>='0'&&c<='9')
				x=x*10+c-'0';
			else
				break;
		}
		return x;
	}
	int main(){
		int tc,n,m,v;
		long long ans;
		tc=read();
		while(tc--){
			n=read();
			m=read();
			v=read();
			for(int i=1;i<=m;i++){
				a[i].id=read();
				a[i].v=read();
			}
			sort(a+1,a+1+m);
			bool flag=true;
			for(int i=1;i<m;i++)
				if(a[i].id==a[i+1].id&&a[i].v!=a[i+1].v){
					flag=false;
					break;
				}
			if(!flag){
				printf("0\n");
				continue;
			}
			ans=pow(v,2*(a[1].id-1),1000000007);
//			cerr<<pow(v,2*(a[1].id-1),1000000007)<<endl;
			for(int i=1;i<m;i++){
				if(a[i+1].id==a[i].id)
					continue;
				ans*=((pow(v,2*(a[i+1].id-a[i].id),1000000007)-(pow(v,a[i+1].id-a[i].id-1,1000000007)*(v-1)%1000000007))%1000000007+1000000007)%1000000007;
//				cerr<<((pow(v,2*(a[i+1].id-a[i].id),1000000007)-(pow(v,a[i+1].id-a[i].id-1,1000000007)*(v-1)%1000000007))%1000000007+1000000007)%1000000007<<endl;
				ans%=1000000007;
			}
			ans*=pow(v,2*(n-a[m].id),1000000007);
//			cerr<<pow(v,2*(n-a[m].id),1000000007)<<endl<<endl;
			ans%=1000000007;
			printf("%lld\n",ans);
		}
		return 0;
	}
}
int main(){
	freopen("assign.in","r",stdin);
	freopen("assign.out","w",stdout);
	estidi::main();
	return 0;
}

递交者: CQ-0213
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 CQ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.7 KiB
递交时间: 2024-12-6 16:37:05
评测时间: 2024-12-6 16:43:54

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

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录