QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#499440#6727. K-hour ClockpagohiaWA 68ms3712kbC++14987b2024-07-31 14:16:302024-07-31 14:16:30

Judging History

你现在查看的是最新测评结果

  • [2024-07-31 14:16:30]
  • 评测
  • 测评结果:WA
  • 用时:68ms
  • 内存:3712kb
  • [2024-07-31 14:16:30]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

const int N = 2e9;
const int M = 5e4 + 10;
typedef long long ll;
typedef double db;
typedef pair<int, int>pii;
typedef pair<long, long>pll;
int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };

inline long long read()
{
	long long w = 1;
	long long q = 0;
	char ch = ' ';
	while (ch != '-' && (ch < '0' || ch>'9')) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (ch >= '0' && ch <= '9')
		q = q * 10 + ch - '0', ch = getchar();
	return w * q;
}
void solve()
{
	long long x, y, z;
	cin >> x >> y >> z;
	long long sum = x+y-z;
	if (sum < z)
	{
		
		cout << -1<< endl;
	}
	else if (sum < 0)
	{
		
		cout << -1 << endl;
		return;

	}
	else if (sum == 0)
	{
		cout << z + 1;
	}
	else
	{
		cout << sum << endl;
		return;
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tcase = 1;
	cin >> tcase;
	while (tcase--)
		solve();
	return 0;

}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3648kb

input:

4
11 18 5
3 49 4
1 9 1
1 3 10

output:

24
48
9
-1

result:

ok 4 cases

Test #2:

score: -100
Wrong Answer
time: 68ms
memory: 3712kb

input:

100000
186826504 580942638 34507146
409013320 825277663 642758065
221040339 32805624 253845963
759538401 529610463 314034771
591738614 223935926 591499221
272890462 257036262 529926724
644722795 540369561 79342760
141738127 915104743 658190166
378771709 735410115 474472687
550207480 676282297 233056...

output:

733261996
-1
-1
975114093
-1
-1
1105749596
-1
639709137
1203184138
-1
1057591501
-1
847965981
-1
-1
-1
1229562136
797923156
-1
-1
-1
913981025
-1
-1
-1
1345234741
-1
1053306920
-1
-1
-1
-1
-1
-1
326906843
-1
-1
-1
-1
-1
-1
241058758
1450926252
-1
-1
-1
-1
-1
-1
1068580042
489254297
-1
803783602
7933...

result:

wrong answer Case #3: Participant says impossible but a solution actually exists (x = 221040339, y = 32805624, z = 253845963, k = -1)