oj.uz

답안 #1086541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086541 2024-09-11T02:11:31 Z mingga Infinite Race (EGOI24_infiniterace2) C++17
34 / 100
 60 ms 12424 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 {
      auto cur = s.lower_bound(x[i]);
      if(*cur == x[i]) {
        s.erase(*cur);
      }
    }
  }
  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
0.0 / 29.0

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

Subtask #2
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 11 ms 2396 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 60 ms 12424 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 12 ms 2216 KB Output is correct
8 Correct 12 ms 2172 KB Output is correct
9 Correct 13 ms 2396 KB Output is correct
10 Correct 16 ms 2504 KB Output is correct
11 Correct 21 ms 2644 KB Output is correct
12 Correct 25 ms 2908 KB Output is correct
13 Correct 30 ms 3156 KB Output is correct
14 Correct 32 ms 3164 KB Output is correct
15 Correct 32 ms 3152 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 17 ms 2960 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 15 ms 3164 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

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