답안 #767385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767385 2023-06-26T17:34:07 Z sraeli Archery (IOI09_archery) C
0 / 100
378 ms 1848 KB
#include <stdio.h>

int main() {
    int N, R;
    scanf("%d %d", &N, &R);

    int myRank, competitorRanks[400000];
    scanf("%d", &myRank);

    for (int i = 0; i < 2 * N - 1; i++) {
        scanf("%d", &competitorRanks[i]);
    }

    int target = 1; // Alvo inicial (alvo 1)
    int round = 1;

    while (round < R) {
        if (target == 1) {
            if (myRank < competitorRanks[0]) {
                target = N; // O perdedor do alvo 1 se move para o alvo N
            }
        } else {
            if (myRank < competitorRanks[(target - 2) * 2]) {
                target--; // Os vencedores se movem para a esquerda
            }
        }

        round++;
    }

    printf("%d\n", target);

    return 0;
}

Compilation message

archery.c: In function 'main':
archery.c:5:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 |     scanf("%d %d", &N, &R);
      |     ^~~~~~~~~~~~~~~~~~~~~~
archery.c:8:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d", &myRank);
      |     ^~~~~~~~~~~~~~~~~~~~
archery.c:11:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d", &competitorRanks[i]);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1748 KB Output isn't correct
2 Incorrect 19 ms 1848 KB Output isn't correct
3 Incorrect 1 ms 1748 KB Output isn't correct
4 Incorrect 1 ms 1748 KB Output isn't correct
5 Incorrect 1 ms 1748 KB Output isn't correct
6 Incorrect 47 ms 1824 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1748 KB Output isn't correct
2 Incorrect 43 ms 1816 KB Output isn't correct
3 Incorrect 17 ms 1748 KB Output isn't correct
4 Incorrect 3 ms 1748 KB Output isn't correct
5 Incorrect 26 ms 1848 KB Output isn't correct
6 Incorrect 3 ms 1748 KB Output isn't correct
7 Incorrect 1 ms 1748 KB Output isn't correct
8 Incorrect 129 ms 1820 KB Output isn't correct
9 Incorrect 14 ms 1848 KB Output isn't correct
10 Incorrect 4 ms 1748 KB Output isn't correct
11 Incorrect 4 ms 1748 KB Output isn't correct
12 Incorrect 2 ms 1748 KB Output isn't correct
13 Incorrect 19 ms 1840 KB Output isn't correct
14 Incorrect 2 ms 1748 KB Output isn't correct
15 Incorrect 5 ms 1836 KB Output isn't correct
16 Incorrect 1 ms 1748 KB Output isn't correct
17 Incorrect 378 ms 1824 KB Output isn't correct
18 Incorrect 13 ms 1844 KB Output isn't correct
19 Incorrect 4 ms 1748 KB Output isn't correct
20 Incorrect 2 ms 1748 KB Output isn't correct
21 Incorrect 5 ms 1748 KB Output isn't correct
22 Incorrect 5 ms 1748 KB Output isn't correct
23 Incorrect 27 ms 1844 KB Output isn't correct
24 Incorrect 2 ms 1748 KB Output isn't correct
25 Incorrect 1 ms 1748 KB Output isn't correct
26 Incorrect 2 ms 1748 KB Output isn't correct
27 Incorrect 8 ms 1840 KB Output isn't correct
28 Incorrect 20 ms 1848 KB Output isn't correct
29 Incorrect 2 ms 1748 KB Output isn't correct
30 Incorrect 2 ms 1748 KB Output isn't correct
31 Incorrect 4 ms 1840 KB Output isn't correct
32 Incorrect 28 ms 1840 KB Output isn't correct
33 Incorrect 1 ms 1748 KB Output isn't correct
34 Incorrect 1 ms 1748 KB Output isn't correct
35 Incorrect 1 ms 1748 KB Output isn't correct
36 Incorrect 2 ms 1748 KB Output isn't correct
37 Incorrect 3 ms 1748 KB Output isn't correct
38 Incorrect 6 ms 1760 KB Output isn't correct
39 Incorrect 1 ms 1748 KB Output isn't correct
40 Incorrect 23 ms 1844 KB Output isn't correct
41 Incorrect 111 ms 1748 KB Output isn't correct
42 Incorrect 75 ms 1828 KB Output isn't correct
43 Incorrect 14 ms 1844 KB Output isn't correct
44 Incorrect 47 ms 1748 KB Output isn't correct
45 Incorrect 11 ms 1844 KB Output isn't correct
46 Incorrect 5 ms 1844 KB Output isn't correct
47 Incorrect 143 ms 1824 KB Output isn't correct