oj.uz

Submission #767415

# Submission time Handle Problem Language Result Execution time Memory
767415 2023-06-26T18:16:52 Z sraeli Archery (IOI09_archery) C
6 / 100
 31 ms 1840 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
    }

    // Verificar se há um arqueiro com classificação menor que a sua à esquerda
    for (int i = 1; i < 2 * N; i++) {
        if (arqueiros[i] < minha_classificacao) {
            return (i + 1) / 2 + 1; // Comece no alvo correspondente
        }
    }

    // Caso contrário, comece no alvo 2
    return 2;
}

int main() {
    int N, R;
    
    if (scanf("%d %d", &N, &R) != 2) {
        printf("Erro na leitura de N e R.\n");
        return 1;
    }

    int arqueiros[2 * N];
    for (int i = 0; i < 2 * N; i++) {
        if (scanf("%d", &arqueiros[i]) != 1) {
            printf("Erro na leitura da classificação dos arqueiros.\n");
            return 1;
        }
    }

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

    return 0;
}

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
6.0 / 94.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 2 ms 340 KB Output isn't correct
5 Incorrect 26 ms 1492 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 0 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 4 ms 340 KB Output isn't correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Incorrect 18 ms 1108 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 1 ms 212 KB Output isn't correct
18 Incorrect 1 ms 256 KB Output isn't correct
19 Incorrect 1 ms 304 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 5 ms 468 KB Output isn't correct
23 Incorrect 27 ms 1660 KB Output isn't correct
24 Incorrect 0 ms 212 KB Output isn't correct
25 Incorrect 0 ms 212 KB Output isn't correct
26 Incorrect 1 ms 212 KB Output isn't correct
27 Incorrect 4 ms 340 KB Output isn't correct
28 Incorrect 19 ms 1236 KB Output isn't correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Incorrect 3 ms 340 KB Output isn't correct
32 Incorrect 26 ms 1620 KB Output isn't correct
33 Incorrect 1 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 0 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 31 ms 1840 KB Output isn't correct