QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#682166#9528. New Energy Vehiclezhw666WA 1ms5764kbC++201.1kb2024-10-27 14:15:062024-10-27 14:15:13

Judging History

This is the latest submission verdict.

  • [2024-10-27 14:15:13]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 5764kb
  • [2024-10-27 14:15:06]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define endl "\n"

using namespace std;
const int N = 1e5+5;
pair<int, int>op[N];
int a[N];
signed main(void)
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		int sumnow = 0;
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
			sumnow += a[i];
		}
		for (int i = 1; i <= m; i++)
		{
			cin >> op[i].first >> op[i].second;
		}
		int now = 0;
		int havenow = 0;
		int anw = 0;
		op[0] = { 0,0 };
		int flag = 1;
		for (int i = 1; i <= m; i++)
		{
			int cango = sumnow - havenow;
			if (cango < op[i].first - op[i - 1].first)
			{
				anw += cango;
				flag = 0;
				break;
			}
			else
			{
				havenow += op[i].first - op[i - 1].first;
				if (a[op[i].second] >= havenow)
				{
					havenow = 0;
				}
				else
				{
					havenow -= a[op[i].second];
				}
				anw += op[i].first - op[i - 1].first;
			}
		}
		if (flag == 0)
			cout << anw << endl;
		else
			cout << anw + (sumnow - havenow) << endl;
	}
	return 0;
}

详细

Test #1:

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

input:

2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1

output:

12
9

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 5764kb

input:

6
3 2
2 2 2
6 1
7 1
2 2
3 3
2 1
6 2
2 3
2 2
5 1
7 2
9 1
2 2
3 3
2 1
6 2
1 1
999999999
1000000000 1
1 1
1000000000
1000000000 1

output:

10
11
4
11
999999999
2000000000

result:

wrong answer 1st lines differ - expected: '9', found: '10'