CSES - Datatähti 2022 alku - Results
Submission details
Task:Spiraali
Sender:Katto
Submission time:2021-10-06 20:14:27 +0300
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED20
#3ACCEPTED65
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1details
#2ACCEPTED0.01 s2details
#3ACCEPTED0.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%ld %ld", &n, &t);
     ~~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%ld %ld", &y, &x);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Code

#include <stdio.h>
#define ull unsigned long long

int main()
{
    long max(long, long);
    long n, t, x, y, sec;
    ull z;

    scanf("%ld %ld", &n, &t);
    const long ntp = n / 2;
    ull lista[t];

    for (long i = 0; i < t; i++)
    {
        scanf("%ld %ld", &y, &x);
        // Program start

        long dx, dy;
        if (x <= ntp)
        {
            if (y <= ntp)
            {
                // Q1
                dx = ntp - x;
                dy = ntp - y;
            }
            else
            {
                // Q2
                dx = ntp - x;
                dy = y - ntp - 1;
            }
        }
        else
        {
            if (y <= ntp)
            {
                // Q4
                dx = x - ntp - 1;
                dy = ntp - y;
            }
            else
            {
                // Q3
                dx = x - ntp - 1;
                dy = y - ntp - 1;
            }
        }
        sec = max(dx, dy);
        // findsec end

        z = n * n - (2 * sec + 2) * (2 * sec + 2);

        if (x == ntp - sec)
        {
            z += y - (ntp - 1 - sec);
        }
        else if (y == ntp + 1 + sec)
        {
            z += 2 * (sec + 1) - 1 + x - (ntp - 1 - sec);
        }
        else if (x == ntp + 1 + sec)
        {
            z += 2 * (2 * (sec + 1) - 1) + (ntp + 2 + sec) - y;
        }
        else
        {
            z += 3 * (2 * (sec + 1) - 1) + (ntp + 2 + sec) - x;
        }

        lista[i] = z;
    }
    for (long i = 0; i < t; i++)
    {
        printf("%llu\n", lista[i]);
    }
    return 0;
}

long max(long a, long b)
{
    if (a > b)
    {
        return a;
    }
    else
    {
        return b;
    }
}

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: 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
93689788375037
...
Truncated