Task: | Coins |
Sender: | Oispa nutellaa |
Submission time: | 2018-05-26 12:32:24 +0300 |
Language: | C++ |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.06 s | details |
#2 | WRONG ANSWER | 0.06 s | details |
#3 | WRONG ANSWER | 0.06 s | details |
#4 | ACCEPTED | 0.08 s | details |
#5 | WRONG ANSWER | 0.05 s | details |
Code
#include <iostream> using namespace std; int n; int mx[4]; int sz[4]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < n; ++i) { int c, s; cin >> c >> s; sz[s]++; mx[s] = max(mx[s], c); if (sz[1] == 0) cout << "<\n"; else if (sz[2] == 0) cout << ">\n"; else if (sz[1] == 1 && mx[2] > mx[1]) { cout << "<\n"; } else if (sz[2] == 1 && mx[1] > mx[2]) { cout << ">\n"; } else cout << "?\n"; } return 0; }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
200000 175878 1 146174 1 4939 2 181388 1 ... |
correct output |
---|
> > > > > ... |
user output |
---|
> > > > ? ... |
Test 2
Verdict: WRONG ANSWER
input |
---|
200000 1 2 2 1 3 2 4 1 ... |
correct output |
---|
< > < > < ... |
user output |
---|
< > < ? ? ... |
Test 3
Verdict: WRONG ANSWER
input |
---|
200000 1 1 2 1 3 1 4 1 ... |
correct output |
---|
> > > > > ... |
user output |
---|
> > > > > ... |
Test 4
Verdict: ACCEPTED
input |
---|
200000 1 1 2 1 3 1 4 1 ... |
correct output |
---|
> > > > > ... |
user output |
---|
> > > > > ... |
Test 5
Verdict: WRONG ANSWER
input |
---|
200000 188909 2 58944 1 26824 1 143263 2 ... |
correct output |
---|
< < ? < < ... |
user output |
---|
< < ? ? ? ... |