NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:35:13: warning: unused variable 'x' [-Wunused-variable]
   35 |         int x , y;
      |             ^
foo.cc:35:17: warning: unused variable 'y' [-Wunused-variable]
   35 |         int x , y;
      |                 ^
Expand

#	状态分数	耗时	内存占用

#1	Wrong Answer 0 Standard answer longer than user output.	2ms	316 KiB
#2	Wrong Answer 0 Standard answer longer than user output.	2ms	400 KiB
#3	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#4	Wrong Answer 0 Standard answer longer than user output.	1ms	508 KiB
#5	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#6	Accepted 5	1ms	512 KiB
#7	Accepted 5	1ms	404 KiB
#8	Accepted 5	1ms	408 KiB
#9	Accepted 5	1ms	404 KiB
#10	Wrong Answer 0 Standard answer longer than user output.	3ms	324 KiB
#11	Wrong Answer 0 Standard answer longer than user output.	12ms	532 KiB
#12	Wrong Answer 0 Standard answer longer than user output.	106ms	1.9 MiB
#13	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#14	Wrong Answer 0 Standard answer longer than user output.	12ms	532 KiB
#15	Wrong Answer 0 Standard answer longer than user output.	111ms	1.8 MiB
#16	Wrong Answer 0 Standard answer longer than user output.	103ms	1.9 MiB
#17	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#18	Wrong Answer 0 Standard answer longer than user output.	13ms	532 KiB
#19	Wrong Answer 0 Standard answer longer than user output.	126ms	1.9 MiB
#20	Wrong Answer 0 Standard answer longer than user output.	124ms	1.9 MiB

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 1e5 + 10;

const int Mod = 1e9 + 7;

int s[N][2];

int fast_(int a , int x)
{
	if(x == 0)
	{
		return 1;
	}
	int re = 1;
	if(x & 1)
	{
		re = a;
	}
	a = (a * a) % Mod;
	return (re * fast_(a , x >> 1)) % Mod;
}

signed main()
{
	freopen("assign.in" , "r" , stdin);
	freopen("assign.out" , "w" , stdout);
	
	int T;
	scanf("%lld" , &T);
	int n , m , v;
	int x , y;
	while(T--)
	{
		scanf("%lld %lld %lld" , &n , &m , &v);
		for(int i = 1 ; i <= m ; i++)
		{
			scanf("%lld %lld" , &s[i][0] , &s[i][1]);
		}
		if(m == 1)
		{
			printf("%lld\n" , fast_((v * v) % Mod , n - 1));
			continue;
		}
	}
}

递交者: TJ-0107
题目: NOIP2024B NOIP2024B
比赛: 【民间数据】NOIP2024 TJ 批量测试
语言: C++14(O2)
代码长度: 728 Bytes
递交时间: 2024-12-1 0:49:51
评测时间: 2024-12-1 0:54:42

分数: 20
总耗时: 626ms
峰值时间: 126ms
峰值内存: 1.9 MiB

20 Wrong Answer

代码

信息

还没有账户？

登录