CSES - DatatÃ¤hti 2022 alku - Results
 Task: Spiraali (Spiral) Sender: Kertor Submission time: 2021-10-05 10:32:24 Language: C++11 Status: READY Result: 35
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s2details
#30.01 s3details

### Code

```#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#define lint long long

int subSpiral(lint y, lint x, lint n) {

lint dx = std::min(n + 1 - x, x);
lint dy = std::min(n + 1 - y, y);
lint depth = std::min(dy, dx);

lint m = n - (depth-1)*2;
lint firstValue = -4*depth*depth + (8 + 8 * n/2)*depth - (3 + 8 * n/2);
lint u = x - (depth-1);
lint v = y - (depth-1);
lint value = 1;
if(v == 1 && u > 1)
{
value = firstValue - 1 + m*3-2 + (m-u);
}
else if(u == m)
{
value = firstValue - 1 + m*2-1 + (m-v);
}
else if(v == m)
{
value = firstValue - 1 + m + (u-1);
}
else
{
value = firstValue - 1 + v;
}
return value;
}

int main ()
{
lint n; std::cin >> n;
lint t; std::cin >> t;
std::vector< std::pair<lint,lint> > locs;
for(int i = 0; i < t; i++) {
lint y; std::cin >> y;
lint x; std::cin >> x;
std::pair<lint, lint> p = std::pair<lint,lint>(y,x);
locs.push_back(p);
}
for(int i = 0; i < t; i++) {
lint value = subSpiral(locs[i].first, locs[i].second, n);
std::cout << value << std::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
...

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

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