NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	512 KiB
#2	Accepted 5	1ms	316 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	328 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	324 KiB
#7	Accepted 5	1ms	316 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	324 KiB
#10	Accepted 5	1ms	508 KiB
#11	Accepted 5	4ms	532 KiB
#12	Accepted 5	44ms	2.1 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	408 KiB
#15	Accepted 5	36ms	1.8 MiB
#16	Accepted 5	14ms	996 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	3ms	408 KiB
#19	Accepted 5	38ms	1.6 MiB
#20	Accepted 5	19ms	1.1 MiB

#include<bits/stdc++.h>
using namespace std;
inline void rd(){}
template<typename T,typename ...U>
inline void rd(T &x,U &...args){
	T f=1;x=0;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+ch-48,ch=getchar();
	x*=f;rd(args...);
}
#define pii pair<int,int> 
#define mkp make_pair
const int N=1e5+5,mod=1e9+7;
int T,n,m,v;
inline int KSM(int x,int n){
	int ans=1;
	while(n){
		if(n&1)ans=1ll*ans*x%mod;
		x=1ll*x*x%mod;
		n>>=1;
	}
	return ans;
}
inline void Solve(){
	rd(n,m,v);
	vector<pii> vc;
	for(int i=1;i<=m;i++){
		int x,y;rd(x,y);
		vc.push_back(mkp(x,y));
	}
	sort(vc.begin(),vc.end());
	int len=vc.size(),fg=0,ans=KSM(1ll*v*v%mod,vc[0].first-1);
	for(int i=0;i<len-1;i++){
		int gap=vc[i+1].first-vc[i].first;
		if(gap==0&&vc[i].second!=vc[i+1].second){
			fg=1;
			break;
		}
		if(gap==0)continue;
		int tmp=1ll*KSM(v,gap-1)*(v-1)%mod;
		ans=1ll*ans*(KSM(1ll*v*v%mod,gap)-tmp+mod)%mod;
	}
	ans=1ll*ans*KSM(1ll*v*v%mod,n-vc[len-1].first)%mod;
	if(fg){
		printf("0\n");
		return ;
	}
	printf("%d\n",ans);
}
signed main(){
	freopen("assign.in","r",stdin);
	freopen("assign.out","w",stdout);
	rd(T);
	while(T--)Solve();
	return 0;
}

递交者: SD-0026
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 SD】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.2 KiB
递交时间: 2024-12-6 16:31:57
评测时间: 2024-12-6 16:42:53

分数: 100
总耗时: 177ms
峰值时间: 44ms
峰值内存: 2.1 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录