QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #630611 | #9351. Game Store | crimsonsunset# | WA | 110ms | 3584kb | C++20 | 706b | 2024-10-11 19:31:09 | 2024-10-11 19:31:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
int last = 0;
vector<int> mx(3);
int mx1 = 0;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
a ^= last;
b ^= last;
last = 0;
if (a == 1) mx1 = max(mx1, b);
else mx[a % 3] = max(mx[a % 3], b);
last = max(mx1 + max(max(mx[2], mx[1]), mx[0]), mx[0] + mx[1] + mx[2]);
cout << last << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
3 1 4 6 7 4 13
output:
4 7 14
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 110ms
memory: 3500kb
input:
500000 395134631858718935 964539556 125290790696511447 743741881 68785955678986648 1867726875 774218610629433714 1107843806 251011758189826329 3218789432 712376502291877860 3368474950 237512969552427655 3307057592 26026853208103063 3366794857 904189246433646740 3824475130 105677592268903953 50111856...
output:
964539556 1319559617 1889305499 1889305499 4797053284 11703903458 22028029215 43923206386 82658016216 113705004204 153529073457 293113338802 473271363212 927032880405 1367686905463 1820499519811 3334443837458 4865622448629 9589930736093 17816343574159 32298028226191 59711804218063 101591040484792 17...
result:
wrong answer 4th lines differ - expected: '2737921248', found: '1889305499'