Task: | Spiraali |
Sender: | LiminalAlien |
Submission time: | 2021-10-07 13:29:23 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 15 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 15 |
#2 | WRONG ANSWER | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | WRONG ANSWER | 0.05 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
using namespace std; #include <iostream> #include <vector> #include <map> #define ll long long map<pair<ll, ll>, ll> m; int main() { ll n, t; cin >> n >> t; for (ll i = 1; i <= t; i++) { ll y, x; cin >> y >> x; m.insert({ {y,x},0 }); } ll y = 0, x = 1, y_y = 1, y_a = n, x_v = 1, x_o = n, d = 1; for (ll k = 1; k <= n * n; k++) { switch (d) { case(1): { y++; if (y == y_a) { x_v++; d = 2; } } break; case(2): { x++; if (x == x_o) { y_a--; d = 3; } } break; case(3): { y--; if (y == y_y) { x_o--; d = 4; } } break; case(4): { x--; if (x == x_v) { y_y++; d = 1; } } break; } if (m.count({ y,x })) { m[{y, x}] = k; t--; } if (!t) break; } for (auto i : m)cout << i.second << endl; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
10 100 1 1 1 2 1 3 1 4 ... |
correct output |
---|
1 36 35 34 33 ... |
user output |
---|
1 36 35 34 33 ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 1000 371 263 915 322 946 880 53 738 ... |
correct output |
---|
773533 312166 206053 200080 593922 ... |
user output |
---|
3508 3322 7529 7126 15725 ... Truncated |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000000 1000 177757853 827347032 409613589 419171337 739269360 256524697 328695530 896842209 ... |
correct output |
---|
571375684522141210 967321186816598569 762879105851175000 370065046779516790 936897883750373771 ... |
user output |
---|
(empty) |