Task: | Spiraali |
Sender: | Salama |
Submission time: | 2021-10-11 13:43:09 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 35 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 15 |
#2 | ACCEPTED | 20 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | ACCEPTED | 0.01 s | 2 | details |
#3 | WRONG ANSWER | 0.01 s | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; int getNum(int n, int x, int y) { if(x == 1) { return y; } else { int tcx, tcy; tcx = min(n-x, x); tcy = min(n-y, y); bool p = false; if(x <= n-y) { //v p = false; } else { p = true; } if(p) { if(tcx <= tcy) { return ((tcx*2+1)*2*n- (tcx*2+1)*(tcx*2+1) + n - y - (tcx-1/2)); } else { return ((tcy*2+1)*(2*n-(tcy*2+1)) - n + (x + (tcy*2+1)/2)); } } else { if(tcx - (((tcx + (n-x < x ? 1 : 0))%2==0 && tcy%2==0) || ((tcx + (n-x < x ? 1 : 0)) == tcy && (tcx + (n-x < x ? 1 : 0))%2==1) ? 1 : 0) < tcy) { return ((tcx-1)*2*(2*n-(tcx-1)*2) - ((tcx-1)*2-1)/2 + y - 1); } else { return (tcy*2*(2*n-tcy*2) - x + tcy*2/2 + 1); } } } } int main () { ios_base::sync_with_stdio(0); cin.tie(0); int n, t, x, y; cin >> n >> t; for(int i = 0; i < t; i++) { cin >> y >> x; cout << getNum(n, x, y) << "\n"; } }
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: WRONG ANSWER
input |
---|
1000000000 1000 177757853 827347032 409613589 419171337 739269360 256524697 328695530 896842209 ... |
correct output |
---|
571375684522141210 967321186816598569 762879105851175000 370065046779516790 936897883750373771 ... |
user output |
---|
1698489882 -1947622871 1054060632 152360822 1338087819 ... Truncated |