Task: | Spiraali |
Sender: | Anttono |
Submission time: | 2021-10-04 10:26:32 +0300 |
Language: | C++ (C++11) |
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 n,t; int main() { cin>>n>>t; int y,x; for(int i=0;i<t;i++) { cin>>y>>x; int round = min(min(x, n-x+1),min(y, n-y+1))-1; int start = n*n - (n-round*2)*(n-round*2) + 1; int progress = 0; if(x>round+1) { progress += n-round*2-1; if(y<n-round) { progress += n-round*2-1; if(x<n-round) { progress += n-round*2-1; progress += n-round-x; } else { progress += n-round-y; } } else { progress += x-(round+1); } } else { progress += y-(round+1); } cout<<start+progress<<'\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 |