NOI批量评测 - 记录详情

foo.cc: In function 'long long int solve()':
foo.cc:22:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   22 |         for(int i=1,j;i<=m;i++) a[i].id=read(),a[i].x=read();a[m+1].id=0;
      |         ^~~
foo.cc:22:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   22 |         for(int i=1,j;i<=m;i++) a[i].id=read(),a[i].x=read();a[m+1].id=0;
      |                                                              ^
foo.cc:22:21: warning: unused variable 'j' [-Wunused-variable]
   22 |         for(int i=1,j;i<=m;i++) a[i].id=read(),a[i].x=read();a[m+1].id=0;
      |                     ^
foo.cc:23:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   23 |         sort(a+1,a+m+1,cmp);int ans=qpow(v,a[1].id-1<<1);
      |                                            ~~~~~~~^~
foo.cc:26:25: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   26 |                         if(a[j].x!=a[i].x) return 0;j++;
      |                         ^~
foo.cc:26:53: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   26 |                         if(a[j].x!=a[i].x) return 0;j++;
      |                                                     ^
foo.cc:28:41: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |                         ans=ans*qpow(v,n-a[i].id<<1)%P;break;
      |                                        ~^~~~~~~~
foo.cc:30:45: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   30 |                 else ans=ans*(qpow(v,a[j].id-a[i].id<<1)+P-(v-1)%P*qpow(v,a[j].id-a[i].id-1)%P)%P;
      |                                      ~~~~~~~^~~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	328 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	324 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	508 KiB
#10	Accepted 5	2ms	444 KiB
#11	Accepted 5	4ms	788 KiB
#12	Accepted 5	38ms	2.1 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	532 KiB
#15	Accepted 5	35ms	2 MiB
#16	Accepted 5	14ms	1.1 MiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	6ms	660 KiB
#19	Accepted 5	35ms	2.1 MiB
#20	Accepted 5	18ms	1.3 MiB

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int Siz=1<<18;char buf[Siz],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Siz,stdin),p1==p2)?EOF:*p1++
int read(){
	int a=0;char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') a=a*10+ch-'0',ch=getchar();
	return a;
}
const int N=1e5+10,P=1e9+7;
int n,m,v;struct _{int id,x;}a[N];
bool cmp(_ a,_ b){return a.id<b.id;}
int qpow(int a,int b){
	int ans=1;while(b){
		b&1?ans=ans*a%P:0;a=a*a%P;b>>=1;
	}return ans;
}
int solve(){
	n=read(),m=read(),v=read();
	for(int i=1,j;i<=m;i++) a[i].id=read(),a[i].x=read();a[m+1].id=0;
	sort(a+1,a+m+1,cmp);int ans=qpow(v,a[1].id-1<<1);
	for(int i=1,j;i<=m;i=j){
		j=i;while(a[j].id==a[i].id){
			if(a[j].x!=a[i].x) return 0;j++;
		}if(a[j].id==0){
			ans=ans*qpow(v,n-a[i].id<<1)%P;break;
		}else if(a[j].id==a[i].id+1) ans=ans*(v*(v-1)%P+1)%P; 
		else ans=ans*(qpow(v,a[j].id-a[i].id<<1)+P-(v-1)%P*qpow(v,a[j].id-a[i].id-1)%P)%P;
	}return ans;
}
signed main(){
	freopen("assign.in","r",stdin);freopen("assign.out","w",stdout);
	int T=read();while(T--) printf("%lld\n",solve());return 0;
}

递交者: FJ-0473
题目: NOIP2024BGF NOIP2024BGF
比赛: 【官方数据 FJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.2 KiB
递交时间: 2024-12-7 0:26:29
评测时间: 2024-12-7 0:26:51

分数: 100
总耗时: 168ms
峰值时间: 38ms
峰值内存: 2.1 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录