CSES - DatatÃ¤hti 2022 alku - Results
 Task: Spiraali (Spiral) Sender: Sahari Kempo Submission time: 2021-10-14 16:29:00 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 <math.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

long long l(long long x, long long y, long long n);
long long k(long long k, long long n);

int main()
{
long long n, t, x, y, i;
vector<long long> v;
cin >> n >> t;

for (i = 0; i < t; i++) {
cin >> x >> y;
v.push_back(l(x, y, n));
}

for (auto i : v)
{
cout << i << "\n";
}
}

long long k(long long k, long long n) {
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1) - 4)))) / 2;
return l;
}

long long l(long long x, long long y, long long n) {
if (x == n / 2 && y == n / 2 + 1) return n*n;
if (x < y) {
long long r = n - x + 1;
if (y <= r) {
long long k = x - 1;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
l += n - (2 * k);
l += 2 * (n - 2 * k - 1);

l += (n - 2 * k) - (y - k);
return l;
}
else
{
long long k = n - y;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
l += n - (2 * k);
l += n - 2 * k - 1;

l += y - x;
return l;
}
}
else if (x == y) {
if (x <= n / 2)
{
long long k = x - 1;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
return l + 1;
}
else
{
long long k = n - x;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
l += n - 2 * k;
l += n - 2 * k - 1;
return l;
}
}
else
{
long long r = n - y + 1;
if (x <= r)
{
long long k = y - 1;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;

l += x - k;
return l;
}
else
{
long long k = n - x;
long long l = (k*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
l += n - 2 * k;

l += y - 1 - k;
return l;
}
}
/*
if (x < y) {
int k = n - x + 1;
if (y <= k) {
long long l = 0;
if (x > 1) l += ((x-1)*((4 * n - 4 + (4 * (n - 2 * (x - 2)) - 4))))/2;
l += n - 2 * (x - 1);
l += 2 * (n - 2 * (x - 1) - 1);
l += n - y - (x - 1);
return l;
}
else
{
k = n - y;
long long l = 0;
l += ((k)*(4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4))) / 2;
l += n - 2 * k;
l += n - 2 * k - 1;
l += (n - 2 * k) - (x - k);
return l;
}
}
else if (x == y) {
if (x <= n / 2)
{
long long l = 1;
l += ((x - 1) * ((4 * n - 4 + (4 * (n - 2 * (x - 2)) - 4)))) / 2;
return l;
}
else
{
int k = n - x;
long long l = 0;
l += ((k) * ((4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4)))) / 2;
l += 2 * (n - 2 * k);
return l - 1;
}
}
else
{
int k = n - y + 1;
if (x <= k) {
long long l = 0;
if (x > 1) l += ((y - 1)*((4 * n - 4 + (4 * (n - 2 * (y - 2)) - 4)))) / 2;
l += x - (y - 1);
return l;
}
else
{
k = n - x;
long long l = 0;
l += (k*((4 * n - 4 + (4 * (n - 2 * (k - 1)) - 4)))) / 2;
l += n - 2 * k - 1;
l += y - k;
return l;
}
}
*/
}

```

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