NOI批量评测 - 记录详情

foo.cc: In function 'void bbcsd()':
foo.cc:28:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   28 |         printf("%d\n", ans);
      |                 ~^     ~~~
      |                  |     |
      |                  int   long long int
      |                 %lld
foo.cc: In function 'int main()':
foo.cc:92:34: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   92 |                         printf("%d\n", ans);
      |                                 ~^     ~~~
      |                                  |     |
      |                                  int   long long int
      |                                 %lld
foo.cc: In function 'void getinit()':
foo.cc:33:28: warning: iteration 14 invokes undefined behavior [-Waggressive-loop-optimizations]
   33 |                 bbarray[i] = 0;
      |                 ~~~~~~~~~~~^~~
foo.cc:32:27: note: within this loop
   32 |         for(int i = 1 ; i <= 15 ; ++i) {
      |                         ~~^~~~~
In function 'void getinit()',
    inlined from 'int main()' at foo.cc:63:11:
foo.cc:33:28: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [120, 127] is out of the bounds [0, 120] of object 'bbarray' with type 'long long int [15]' [-Warray-bounds=]
   33 |                 bbarray[i] = 0;
      |                 ~~~~~~~~~~~^~~
foo.cc: In function 'int main()':
foo.cc:13:5: note: 'bbarray' declared here
   13 | int bbarray[15];
      |     ^~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Wrong Answer 0 读取到 16，应为 14。	2ms	408 KiB
#2	Wrong Answer 0 读取到 1024，应为 784。	2ms	404 KiB
#3	Wrong Answer 0 读取到 256，应为 126。	1ms	508 KiB
#4	Wrong Answer 0 读取到 65536，应为 27648。	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#7	Wrong Answer 0 Standard answer longer than user output.	1ms	324 KiB
#8	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#9	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#10	Wrong Answer 0 读取到 86738417，应为 903189684。	2ms	320 KiB
#11	Wrong Answer 0 读取到 713628092，应为 5568271。	13ms	404 KiB
#12	Wrong Answer 0 读取到 611907699，应为 789710747。	114ms	1.2 MiB
#13	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#14	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#15	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#16	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#17	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#18	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#19	Wrong Answer 0 Standard answer longer than user output.	1ms	324 KiB
#20	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<vector>

using namespace std;
#define MOD 1000000007
#define MAXN 100005
#define int long long
int T;
int n, m, v;
int bbarray[15];
int ans = 0;
int spa[MAXN];

inline void bbcsd() {
	ans = (1<<(2*n-2))%MOD; 
	for(int a = 1 ; a <= v ; ++a) {
		for(int b = 1 ; b <= v ; ++b) {
			for(int i = 1 ; i < n ; ++i) {
				if(bbarray[i] == a && bbarray[i+1] != b && bbarray[i+1] > 0) {
					ans--;
				}
			}
		}
	}
	printf("%d\n", ans);
}

inline void getinit() {
	for(int i = 1 ; i <= 15 ; ++i) {
		bbarray[i] = 0;
	}
}

inline int get_anss(int n) {
	ans = v;
	for(int i = 1 ; i <= 2*n-1 ; ++i) {
		ans = (ans*ans)%MOD;
	}
	int ctt = n;
	for(int i = 1 ; i <= v-1 ; ++i) {
		ctt = (ctt*ctt)%MOD;
	}
	
	ans = (ans-ctt+MOD)%MOD;
	return ans;
}

signed main() {
	freopen("assign.in", "r", stdin);
	freopen("assign.out", "w", stdout);
	
	scanf("%lld", &T);
	while(T--) {
		bool impss = false;
		ans = 0;
		scanf("%lld%lld%lld", &n, &m, &v);
		
		//1~5
		if(v == 2) {
			getinit();
			int cj=0, dj=0;
			for(int i = 1 ; i <= m ; ++i) {
				scanf("%lld%lld", &cj, &dj);
				if(bbarray[cj] != dj && bbarray[cj] != 0) {
					impss = true;
				}
				bbarray[cj] = dj;
			} 
			
			if(impss) {
				printf("0\n");
				continue;
			}
			
			bbcsd();
			continue;
		}
		
		//A 
		if(n == m) {
			int cj=0, dj=0;
			for(int i = 1 ; i <= m ; ++i) {
				scanf("%lld%lld", &cj, &dj);
				spa[cj] = dj;
			}
			
			ans = get_anss(n);
			
			printf("%d\n", ans);
		}
		
	}
	
	return 0;
}

递交者: TJ-0089
题目: NOIP2024B NOIP2024B
比赛: 【民间数据】NOIP2024 TJ 批量测试
语言: C++14(O2)
代码长度: 1.6 KiB
递交时间: 2024-12-1 0:49:50
评测时间: 2024-12-1 0:53:44

分数: 5
总耗时: 151ms
峰值时间: 114ms
峰值内存: 1.2 MiB

5 Wrong Answer

代码

信息

还没有账户？

登录