oj.uz

Submission #1078327

# Submission time Handle Problem Language Result Execution time Memory
1078327 2024-08-27T15:21:24 Z horiaboeriu Infinite Race (EGOI24_infiniterace2) C++17
0 / 100
 0 ms 348 KB 
#include <stdio.h>
#include <stdlib.h>
#define MAXN 200000
int 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 = 1; i <= q; i++) {
        scanf("%d", &x);
        if (x < 0) {
            f[-x] = 0;
        } else {
            if (f[x] >= ul) {
                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 = i;
            }
            f[x] = i;
        }
    }
    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
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -