CSES - Datatähti 2022 alku - Results
Submission details
Task:Spiraali (Spiral)
Sender:Katto
Submission time:2021-10-06 18:38:34
Language:C++17
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.01 s2details
#30.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:9:26: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long unsigned int*' [-Wformat=]
     scanf("%d %d", &n, &t);
                    ~~    ^
input/code.cpp:9:26: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long unsigned int*' [-Wformat=]
input/code.cpp:14:30: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long unsigned int*' [-Wformat=]
         scanf("%d %d", &y, &x);
                        ~~    ^
input/code.cpp:14:30: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long unsigned int*' [-Wformat=]
input/code.cpp:40:32: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long unsigned int' [-Wformat=]
         printf("%d\n", lista[i]);
                        ~~~~~~~~^
input/code.cpp:9:10: warning: ignoring return value of 'int scanf(const char*,

Code

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

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

    scanf("%d %d", &n, &t);
    ull lista[t];

    for (ull i = 0; i < t; i++)
    {
        scanf("%d %d", &y, &x);
        // Program start
        sec = findsec(x, y, n);
        z = n * n - (2 * sec + 2) * (2 * sec + 2);

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

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

ull findsec(ull x, ull y, ull n) // Sektori on etäisyyden mukaan määräytyvä rengasmainen alue
{
    for (ull i = 0; i < n / 2; i++)
    {
        if (n / 2 - i <= x && x <= n / 2 + 1 + i && n / 2 - i <= y && y <= n / 2 + 1 + i)
        {
            return i;
        }
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
10 100
1 1
1 2
1 3
1 4
...

correct output
1
36
35
34
33
...

user output
(empty)

Test 2

Group: 2

Verdict:

input
1000 1000
371 263
915 322
946 880
53 738
...

correct output
773533
312166
206053
200080
593922
...

user output
(empty)

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
(empty)