QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#373099 | #7779. Swiss Stage | acidlemon# | WA | 0ms | 3520kb | C++17 | 523b | 2024-04-01 02:23:57 | 2024-04-01 02:23:57 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
map<pair<int, int>, int> mp;
mp[{1, 0}] = 1;
mp[{0, 1}] = 1;
mp[{1, 1}] = 1;
mp[{2, 0}] = 2;
mp[{0, 2}] = 2;
mp[{2, 1}] = 2;
mp[{1, 2}] = 2;
mp[{2, 2}] = 2;
int ans = 0;
do {
ans += mp[{x, y}];
if (x == 0 && y == 1) {
y = 2;
continue;
}
++x;
} while (x <= 2);
cout << ans << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3520kb
input:
0 1
output:
7
result:
wrong answer 1st numbers differ - expected: '4', found: '7'