NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:45:14: warning: unused variable 'file1' [-Wunused-variable]
   45 |         auto file1=freopen("assign.in","r",stdin);
      |              ^~~~~
foo.cc:46:14: warning: unused variable 'file2' [-Wunused-variable]
   46 |         auto file2=freopen("assign.out","w",stdout);
      |              ^~~~~
Expand

#	状态分数	耗时	内存占用

#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	316 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	2ms	404 KiB
#11	Accepted 5	4ms	532 KiB
#12	Accepted 5	40ms	1.8 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	408 KiB
#15	Accepted 5	36ms	1.7 MiB
#16	Accepted 5	14ms	960 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	4ms	404 KiB
#19	Accepted 5	38ms	1.9 MiB
#20	Accepted 5	19ms	1 MiB

#include<bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
#define pub emplace_back
#define pob pop_back
using namespace std;
typedef long long ll;
mt19937 rd(time(0));
int read(){
	int x=0;bool op=0;char c=getchar();
	while(!isdigit(c)) op|=c=='-',c=getchar();
	while(isdigit(c)) x=x*10+c-48,c=getchar();
	return op?-x:x;
}
const int N=1e5+10;
const int mod=1e9+7;
int n,m;ll V,sq;
pair<int,ll> nd[N];
ll ksm(ll x,ll y){
	ll res=1;
	for(;y;y>>=1){
		if(y&1) res=res*x%mod;
		x=x*x%mod;
	}
	return res;
}
void work(){
	n=read(),m=read(),V=read(),sq=V*V%mod;
	for(int i=1;i<=m;i++) nd[i].fi=read(),nd[i].se=read();
	sort(nd+1,nd+1+m);
	m=unique(nd+1,nd+1+m)-nd-1;
	for(int i=1;i<m;i++) if(nd[i].fi==nd[i+1].fi){puts("0");return;}
	ll ans=1;
	ans=ans*ksm(sq,nd[1].fi-1)%mod;
	for(int i=1;i<m;i++){
		ll res=ksm(V,nd[i+1].fi-nd[i].fi-1)*(V-1)%mod;
		ll okres=(ksm(sq,nd[i+1].fi-nd[i].fi)-res)%mod;
		ans=ans*okres%mod;
	}
	ans=ans*ksm(sq,n-nd[m].fi)%mod;
	printf("%lld\n",(ans%mod+mod)%mod);
}
int main(){
	auto file1=freopen("assign.in","r",stdin);
	auto file2=freopen("assign.out","w",stdout);
	int tt=read();while(tt--) work();
	return 0;
}

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

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

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录