Task: | Spiraali |
Sender: | kpop |
Submission time: | 2021-10-06 09:06:00 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 35 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 15 |
#2 | ACCEPTED | 20 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | ACCEPTED | 0.01 s | 2 | details |
#3 | RUNTIME ERROR | 0.71 s | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; vector<int> vi; int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> t; vi.push_back(0); for (int i = 0; i < floor(n/2); ++i) { int cur = ((i*(-2)+n)*4)-4; vi.push_back(vi.back()+cur); } for (int i = 0; i < t; ++i) { int x, y; cin >> y >> x; int up = y-1; int bottom = n-y; int left = x-1; int right = n-x; int dist = min(up, min(bottom, min(left, right))); int nth = dist+1; int result = vi[dist]; int side = n-(2*dist); if (dist == left) { cout << result+(y-nth)+1 << endl; continue; } result += side; if (dist == bottom) { cout << result+(x-nth) << endl; continue; } result += side-1; if (dist == right) { cout << result+(n-y-dist) << endl; continue; } result += side-1; if (dist == up) { cout << result+(n-x)-dist << endl; continue; } } }
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: ACCEPTED
input |
---|
1000 1000 371 263 915 322 946 880 53 738 ... |
correct output |
---|
773533 312166 206053 200080 593922 ... |
user output |
---|
773533 312166 206053 200080 593922 ... Truncated |
Test 3
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000000000 1000 177757853 827347032 409613589 419171337 739269360 256524697 328695530 896842209 ... |
correct output |
---|
571375684522141210 967321186816598569 762879105851175000 370065046779516790 936897883750373771 ... |
user output |
---|
(empty) |