oj.uz

Submission #1086536

# Submission time Handle Problem Language Result Execution time Memory
1086536 2024-09-11T02:06:22 Z mingga Infinite Race (EGOI24_infiniterace2) C++17
63 / 100
 59 ms 14052 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;
}

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();
    }
    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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 9 ms 840 KB Output is correct
5 Correct 9 ms 960 KB Output is correct
6 Correct 9 ms 956 KB Output is correct
7 Correct 8 ms 860 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 836 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 736 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 9 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 7 ms 856 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 6 ms 708 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 59 ms 14052 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 11 ms 2272 KB Output is correct
8 Correct 12 ms 2396 KB Output is correct
9 Correct 13 ms 2392 KB Output is correct
10 Correct 16 ms 2552 KB Output is correct
11 Correct 20 ms 2648 KB Output is correct
12 Correct 25 ms 2908 KB Output is correct
13 Correct 28 ms 3584 KB Output is correct
14 Correct 32 ms 4700 KB Output is correct
15 Correct 33 ms 4696 KB Output is correct
16 Correct 32 ms 4700 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 16 ms 4696 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 16 ms 4604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 1884 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 9 ms 840 KB Output is correct
5 Correct 9 ms 960 KB Output is correct
6 Correct 9 ms 956 KB Output is correct
7 Correct 8 ms 860 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 836 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 736 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 9 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 7 ms 856 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 6 ms 708 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 59 ms 14052 KB Output is correct
26 Correct 1 ms 1884 KB Output is correct
27 Correct 11 ms 2272 KB Output is correct
28 Correct 12 ms 2396 KB Output is correct
29 Correct 13 ms 2392 KB Output is correct
30 Correct 16 ms 2552 KB Output is correct
31 Correct 20 ms 2648 KB Output is correct
32 Correct 25 ms 2908 KB Output is correct
33 Correct 28 ms 3584 KB Output is correct
34 Correct 32 ms 4700 KB Output is correct
35 Correct 33 ms 4696 KB Output is correct
36 Correct 32 ms 4700 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 16 ms 4696 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 16 ms 4604 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 1884 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 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 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 1 ms 348 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Incorrect 0 ms 348 KB Output isn't correct
59 Halted 0 ms 0 KB -