QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#601114#9296. Golden SpiritmiluosiWA 0ms3572kbC++14558b2024-09-29 20:52:582024-09-29 20:52:58

Judging History

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

  • [2024-09-29 20:52:58]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3572kb
  • [2024-09-29 20:52:58]
  • 提交

answer

#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<string.h>
#include<iomanip>
#include<queue>
using namespace std;
const int N = 200015;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
//int mod = 998244353;

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		ull n, x, t;
		cin >> n >> x >> t;
		ull z = n*t+ n * t;
		ull ans = z + z + max(ull(0), x - z + t + t);
		cout << ans << endl;
	}

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3572kb

input:

3
2 2 2
3 1 10
11 45 14

output:

14
81
381

result:

wrong answer 1st lines differ - expected: '16', found: '14'