NOI批量评测 - 记录详情

foo.cc: In function 'void solve()':
foo.cc:73:17: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
   73 |                 else mul=mul*calc2(x-lst)%cht;lst=x;
      |                 ^~~~
foo.cc:73:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
   73 |                 else mul=mul*calc2(x-lst)%cht;lst=x;
      |                                               ^~~
foo.cc:53:14: warning: unused variable 'fg' [-Wunused-variable]
   53 |         bool fg=0;
      |              ^~
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	408 KiB
#6	Accepted 5	1ms	316 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	404 KiB
#9	Accepted 5	1ms	324 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	4ms	532 KiB
#12	Accepted 5	40ms	1.9 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	3ms	404 KiB
#15	Accepted 5	36ms	1.8 MiB
#16	Accepted 5	14ms	916 KiB
#17	Accepted 5	2ms	404 KiB
#18	Accepted 5	3ms	408 KiB
#19	Accepted 5	38ms	1.9 MiB
#20	Accepted 5	20ms	1 MiB

#include<map>
#include<set>
#include<cmath>
#include<bitset>
#include<cstdio>
#include<random>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
#define her1 20081214
#define cht 1000000007
#define IV void
#define ull unsigned long long
#define mem(x,val) memest(x,val,sizeof x)
#define F(i,j,n)for(register int i=j;i<=n;i++)
#define D(i,j,n)for(register int i=j;i>=n;i--)
#define E(i,now)for(register int i=first[now];i;i=e[i].nxt)
#define FL(i,j,n)for(register i64 i=j;i<=n;i++)
#define DL(i,j,n)for(register i64 i=j;i>=n;i--)
#define EL(i,now)for(register i64 i=first[now];i;i=e[i].nxt)
ll read(){
	ll ans=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')ans=ans*10+c-'0',c=getchar();
	return ans*f;
}
#undef ll
#include "assert.h"
mt19937_64 rnd(her1);
#include "functional"
using i64 = long long;
const int maxn = 1e6+5;
i64 n,m,v,c[maxn],d[maxn];
i64 qpow(i64 n,i64 base=cht-2){
	i64 ans=1;
	while(base){
		if(base&1)ans=ans*n%cht;
		n=n*n%cht;base>>=1;
	}
	return ans;
}
pair<i64,i64>pi[maxn];
IV solve(){
	n=read();m=read();v=read();//mp.clear();
	bool fg=0;
	F(i,1,m){
		pi[i].first=read();
		pi[i].second=read();
	}
	// if(fg)return(void)(puts("0"));
	sort(pi+1,pi+1+m);
	if(v==1){puts("1");return;}
	i64 lst=0;
	auto calc1=[&](i64 L)->i64{
		return qpow(v*v%cht,L);
	};
	auto calc2=[&](i64 L)->i64{
		return(calc1(L)-qpow(v,L-1)*(v-1))%cht;
	};
	i64 mul=1;bool flag=1;
	F(i,1,m){
		if(i==1||pi[i-1].first!=pi[i].first){
			i64 x=pi[i].first;
		if(!lst)mul=mul*calc1(x-1)%cht;
		else mul=mul*calc2(x-lst)%cht;lst=x;
		}
		else flag&=(pi[i-1].second==pi[i].second);
	}
	if(!flag)return(void)(puts("0"));
	mul=mul*calc1(n-lst)%cht;
	printf("%lld\n",(mul+cht)%cht);
}
int main(){
	freopen("assign.in","r",stdin);
	freopen("assign.out","w",stdout);
	i64 T=read();while(T--)solve();return 0;
}

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

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

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录