oj.uz

Submission #767362

# Submission time Handle Problem Language Result Execution time Memory
767362 2023-06-26T17:00:25 Z sraeli Archery (IOI09_archery) C
2 / 100
 29 ms 1844 KB 
#include <stdio.h>

int encontrar_posicao_inicial(int N, int* arqueiros) {
    int minha_classificacao = arqueiros[0]; // Sua classificação é o primeiro elemento do array

    // Verificar se você é o melhor ou o pior arqueiro
    if (minha_classificacao == 1 || minha_classificacao == 2 * N) {
        return 1; // Se você for o melhor ou o pior, comece no alvo 1
    } else {
        return 2; // Caso contrário, comece no alvo 2
    }
}

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

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

    int posicao_inicial = encontrar_posicao_inicial(N, arqueiros);
    printf("%d\n", posicao_inicial);

    return 0;
}

Compilation message

archery.c: In function 'main':
archery.c:16:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d %d", &N, &R);
      |     ^~~~~~~~~~~~~~~~~~~~~~
archery.c:20:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d", &arqueiros[i]);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct

Subtask #2
2.0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 2 ms 340 KB Output isn't correct
5 Incorrect 24 ms 1492 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Incorrect 2 ms 340 KB Output isn't correct
9 Incorrect 3 ms 340 KB Output isn't correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Incorrect 3 ms 340 KB Output isn't correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Incorrect 17 ms 1236 KB Output isn't correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Incorrect 5 ms 468 KB Output isn't correct
16 Incorrect 0 ms 212 KB Output isn't correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Incorrect 1 ms 212 KB Output isn't correct
19 Incorrect 1 ms 212 KB Output isn't correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Incorrect 3 ms 340 KB Output isn't correct
22 Incorrect 4 ms 468 KB Output isn't correct
23 Incorrect 25 ms 1620 KB Output isn't correct
24 Incorrect 0 ms 212 KB Output isn't correct
25 Incorrect 1 ms 212 KB Output isn't correct
26 Incorrect 1 ms 212 KB Output isn't correct
27 Incorrect 3 ms 340 KB Output isn't correct
28 Incorrect 19 ms 1236 KB Output isn't correct
29 Incorrect 1 ms 212 KB Output isn't correct
30 Incorrect 1 ms 212 KB Output isn't correct
31 Incorrect 3 ms 340 KB Output isn't correct
32 Incorrect 25 ms 1652 KB Output isn't correct
33 Incorrect 0 ms 212 KB Output isn't correct
34 Correct 0 ms 212 KB Output is correct
35 Incorrect 1 ms 212 KB Output isn't correct
36 Incorrect 1 ms 212 KB Output isn't correct
37 Incorrect 3 ms 340 KB Output isn't correct
38 Incorrect 4 ms 468 KB Output isn't correct
39 Incorrect 0 ms 212 KB Output isn't correct
40 Incorrect 1 ms 212 KB Output isn't correct
41 Incorrect 1 ms 212 KB Output isn't correct
42 Incorrect 1 ms 212 KB Output isn't correct
43 Incorrect 1 ms 212 KB Output isn't correct
44 Incorrect 2 ms 340 KB Output isn't correct
45 Incorrect 3 ms 340 KB Output isn't correct
46 Incorrect 3 ms 340 KB Output isn't correct
47 Incorrect 29 ms 1844 KB Output isn't correct