CSES - Putka Open 2015 – 1/6 - Results
Submission details
Task:Aita
Sender:
Submission time:2015-07-19 16:36:16 +0300
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED17
#2ACCEPTED28
#3ACCEPTED55
Test results
testverdicttimegroup
#1ACCEPTED0.08 s1details
#2ACCEPTED0.08 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.07 s1details
#5ACCEPTED0.07 s1details
#6ACCEPTED0.09 s2details
#7ACCEPTED0.08 s2details
#8ACCEPTED0.10 s2details
#9ACCEPTED0.10 s2details
#10ACCEPTED0.08 s2details
#11ACCEPTED0.07 s3details
#12ACCEPTED0.11 s3details
#13ACCEPTED0.09 s3details
#14ACCEPTED0.09 s3details
#15ACCEPTED0.06 s3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
                           ^

Code

#include <stdio.h>

int A[500000];
#define ABS(a) ((a < 0) ? -(a): (a))

int main(int argc, char *argv[])
{
    int n, k;
    int i, j;


    scanf("%d %d", &n, &k);

    j = 0;
    for (i=0; 2*i+1 < n; i++) {
        A[2*i+1] = j++;
    }
    for (i=0; 2*i < n; i++) {
        A[2*i] = j++;
    }
    for (i = 1; i < n; i++) {
        if (ABS(A[i]-A[i-1]) < k) {
            goto gtfo;
        }
    }

    for (i = 0; i < n; i++)
        printf((i < n-1) ? "%d " : "%d\n", A[i]+1);

    return 0;
gtfo:
    puts("QAQ");
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
2 2

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
3 2

correct output
QAQ

user output
QAQ

Test 3

Group: 1

Verdict: ACCEPTED

input
4 2

correct output
3 1 4 2 

user output
3 1 4 2

Test 4

Group: 1

Verdict: ACCEPTED

input
7 4

correct output
QAQ

user output
QAQ

Test 5

Group: 1

Verdict: ACCEPTED

input
8 4

correct output
5 1 6 2 7 3 8 4 

user output
5 1 6 2 7 3 8 4

Test 6

Group: 2

Verdict: ACCEPTED

input
80476 2

correct output
40239 1 40240 2 40241 3 40242 ...

user output
40239 1 40240 2 40241 3 40242 ...

Test 7

Group: 2

Verdict: ACCEPTED

input
68652 2

correct output
34327 1 34328 2 34329 3 34330 ...

user output
34327 1 34328 2 34329 3 34330 ...

Test 8

Group: 2

Verdict: ACCEPTED

input
62735 2

correct output
31368 1 31369 2 31370 3 31371 ...

user output
31368 1 31369 2 31370 3 31371 ...

Test 9

Group: 2

Verdict: ACCEPTED

input
71954 2

correct output
35978 1 35979 2 35980 3 35981 ...

user output
35978 1 35979 2 35980 3 35981 ...

Test 10

Group: 2

Verdict: ACCEPTED

input
4 2

correct output
3 1 4 2 

user output
3 1 4 2

Test 11

Group: 3

Verdict: ACCEPTED

input
89814 3

correct output
44908 1 44909 2 44910 3 44911 ...

user output
44908 1 44909 2 44910 3 44911 ...

Test 12

Group: 3

Verdict: ACCEPTED

input
91140 5

correct output
45571 1 45572 2 45573 3 45574 ...

user output
45571 1 45572 2 45573 3 45574 ...

Test 13

Group: 3

Verdict: ACCEPTED

input
66703 16675

correct output
33352 1 33353 2 33354 3 33355 ...

user output
33352 1 33353 2 33354 3 33355 ...

Test 14

Group: 3

Verdict: ACCEPTED

input
66666 33333

correct output
33334 1 33335 2 33336 3 33337 ...

user output
33334 1 33335 2 33336 3 33337 ...

Test 15

Group: 3

Verdict: ACCEPTED

input
66666 33334

correct output
QAQ

user output
QAQ