CSES - DatatÃ¤hti 2022 alku - Results
 Task: Spiraali (Spiral) Sender: tonero Submission time: 2021-10-05 19:04:14 Language: C++17 Status: READY Result: 100
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED20
#3ACCEPTED65
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s2details
#3ACCEPTED0.01 s3details

### Code

```#include <bits/stdc++.h>

using namespace std;
#define ll long long

int getDist(int x, int y, int n){
return min(min(x-1, n - x), min(y-1, n - y));
}

int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, t;
cin >> n >> t;

for (int i = 0; i < t; i++)
{
ll currnum = 0;
int iterations = 0;
int xcoord = 1;
int ycoord = 0;
int n2 = n;
int x, y;
cin >> y >> x;

if (x == 1)
{
std::cout << y;
std::cout << '\n';
continue;
}
else if (x == n / 2 + 1 && y == n / 2)
{
ll n3 = (ll)n2;
std::cout << n3 * n3;
std::cout << '\n';
continue;
}

ll dist = getDist(x,y,n);

ll n3 = (ll) n;
ll sum = ((dist)*(n3+(n3-(dist)*2)))/2;
currnum = sum*4;
n2 = n-dist*2;
iterations = dist;

xcoord += iterations;
ycoord += iterations;

if (xcoord == x && ycoord == y)
{
}
else if (xcoord == x && y > ycoord)
{
}else{
if(ycoord == y){
}else{
if(xcoord == x){
}else{
}
}
}

std::cout << currnum;
std::cout << '\n';
}

flush(std::cout);
}```

### 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
...

#### 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
...

#### Test 3

Group: 3

Verdict: ACCEPTED

input
1000000000 1000
177757853 827347032
409613589 419171337
739269360 256524697
328695530 896842209
...

correct output
571375684522141210
967321186816598569
762879105851175000
370065046779516790
936897883750373771
...

user output
571375684522141210
967321186816598569
762879105851175000
370065046779516790
936897883750373771
...