oj.uz

Submission #1086542

# Submission time Handle Problem Language Result Execution time Memory
1086542 2024-09-11T02:14:56 Z mingga Infinite Race (EGOI24_infiniterace2) C++17
63 / 100
 62 ms 12632 KB 
#include "bits/stdc++.h"

using namespace std;

#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin()                  \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define int long long
int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int n, q;
int x[N];

void sub1() {
  int cnt = 0;
  int cur = 0;
  while(q--) {
    int u; cin >> u;
    if(u < 0) {
      cur = 0;
    } else {
      if(cur == 1) cnt++;
      else cur = 1;
    }
  }
  cout << cnt;
}

void sub2() {
  vector<int> state(n+1, 0);
  int ans = 0;
  int cur = 0;
  set<int> s;
  for(int i = 1; i <= q; i++) {
    // cout << x[i] << ' ' << *s.lower_bound(x[i])
    if(*s.lower_bound(x[i]) == x[i]) {
      ans++;
      s.clear();
    }
      s.insert(x[i]);
    // cout << ans << ' ';
  }
  cout << ans;
}

void full() {
  set<int> s;
  int ans = 0;
  for(int i = 1; i <= q; i++) {
    cin >> x[i];
    if(x[i] > 0) {
      if(*s.lower_bound(x[i]) == x[i]) {
        ans++;
        s.clear();
      }
      s.insert(x[i]);
    } else {
      x[i] = -x[i];
      auto cur = s.lower_bound(-x[i]);
      if(*cur == x[i]) {
        s.erase(*cur);
      }
    }
    // cout << ans << ' ';
  }
  cout << ans;
}

signed main() {
    fast_cin();
    cin >> n >> q;
    // if(n == 2) sub1();
    // else {
    //   bool ok = 1;
    //   for(int i = 1; i <= q; i++) {
    //     cin >> x[i];
    //     if(x[i] < 0) ok = 0;
    //   }
    //   if(ok) sub2();
    // }
    full();
    cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC;
}

Compilation message

Main.cpp: In function 'void sub2()':
Main.cpp:43:7: warning: unused variable 'cur' [-Wunused-variable]
   43 |   int cur = 0;
      |       ^~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2428 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 11 ms 2500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 11 ms 2360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 9 ms 2272 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 11 ms 2292 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 11 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 18 ms 2300 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 10 ms 2400 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 62 ms 12632 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 12 ms 2316 KB Output is correct
8 Correct 12 ms 2392 KB Output is correct
9 Correct 14 ms 2396 KB Output is correct
10 Correct 16 ms 2396 KB Output is correct
11 Correct 20 ms 2604 KB Output is correct
12 Correct 24 ms 2948 KB Output is correct
13 Correct 28 ms 3156 KB Output is correct
14 Correct 35 ms 3224 KB Output is correct
15 Correct 34 ms 3204 KB Output is correct
16 Correct 34 ms 3152 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 19 ms 3164 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 18 ms 3160 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2428 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 11 ms 2500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 11 ms 2360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 9 ms 2272 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 11 ms 2292 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 11 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 18 ms 2300 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 10 ms 2400 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 62 ms 12632 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 2316 KB Output is correct
28 Correct 12 ms 2392 KB Output is correct
29 Correct 14 ms 2396 KB Output is correct
30 Correct 16 ms 2396 KB Output is correct
31 Correct 20 ms 2604 KB Output is correct
32 Correct 24 ms 2948 KB Output is correct
33 Correct 28 ms 3156 KB Output is correct
34 Correct 35 ms 3224 KB Output is correct
35 Correct 34 ms 3204 KB Output is correct
36 Correct 34 ms 3152 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 19 ms 3164 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 18 ms 3160 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Halted 0 ms 0 KB -