oj.uz

답안 #1078320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078320 2024-08-27T15:17:16 Z horiaboeriu Infinite Race (EGOI24_infiniterace2) C++17
29 / 100
 17 ms 1808 KB 
#include <stdio.h>
#include <stdlib.h>
#define MAXN 200000
char f[MAXN];//in f[x] este 0 daca x este in fata si 1 daca ea este in fata pe teren
int main()
{
    int n, q, i, x, rez, ul;
    scanf("%d%d", &n, &q);
    rez = ul = 0;
    for (i = 0; i < q; i++) {
        scanf("%d", &x);
        if (x < 0) {
            f[-x] = 0;
        } else {
            if (f[x] > 0) {
                if (ul == x || ul == 0) {
                    rez++;
                }
                //acum il intrece doar pe x, deci da o tura intreaga si restul din fata ei raman in fata si cele din spate dupa ce face tura vor ajunge in fata
                ul = x;
            }
            f[x] = 1;
        }
    }
    printf("%d\n", rez);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 11 ms 348 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 11 ms 900 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 10 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 916 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 788 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 9 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 17 ms 1808 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 11 ms 772 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 412 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 11 ms 348 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 11 ms 900 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 10 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 916 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 788 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 9 ms 604 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 17 ms 1808 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 11 ms 772 KB Output isn't correct
28 Halted 0 ms 0 KB -