oj.uz

답안 #572278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572278 2022-06-04T07:41:06 Z SSRS 돌 무게 재기 (IZhO11_stones) C++14
100 / 100
 224 ms 3684 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
struct lazy_segment_tree{
  int N;
  vector<int> mn, mx, lazy;
  lazy_segment_tree(int N2){
    N = 1;
    while (N < N2){
      N *= 2;
    }
    mn = vector<int>(N * 2 - 1, INF);
    mx = vector<int>(N * 2 - 1, -INF);
    for (int i = 0; i < N2; i++){
      mn[N - 1 + i] = 0;
      mx[N - 1 + i] = 0;
    }
    for (int i = N - 2; i >= 0; i--){
      mn[i] = min(mn[i * 2 + 1], mn[i * 2 + 2]);
      mx[i] = max(mx[i * 2 + 1], mx[i * 2 + 2]);
    }
    lazy = vector<int>(N * 2 - 1, 0);
  }
  void eval(int i){
    if (i < N - 1){
      lazy[i * 2 + 1] += lazy[i];
      lazy[i * 2 + 2] += lazy[i];
    }
    mn[i] += lazy[i];
    mx[i] += lazy[i];
    lazy[i] = 0;
  }
  void range_add(int L, int R, int x, int i, int l, int r){
    eval(i);
    if (r <= L || R <= l){
      return;
    } else if (L <= l && r <= R){
      lazy[i] += x;
      eval(i);
    } else {
      int m = (l + r) / 2;
      range_add(L, R, x, i * 2 + 1, l, m);
      range_add(L, R, x, i * 2 + 2, m, r);
      mn[i] = min(mn[i * 2 + 1], mn[i * 2 + 2]);
      mx[i] = max(mx[i * 2 + 1], mx[i * 2 + 2]);
    }
  }
  void range_add(int L, int R, int x){
    range_add(L, R, x, 0, 0, N);
  }
  int all_min(){
    eval(0);
    return mn[0];
  }
  int all_max(){
    eval(0);
    return mx[0];
  }
};
int main(){
  int N;
  cin >> N;
  lazy_segment_tree ST(N);
  for (int i = 0; i < N; i++){
    int R, S;
    cin >> R >> S;
    if (S == 1){
      ST.range_add(0, R, -1);
    }
    if (S == 2){
      ST.range_add(0, R, 1);
    }
    if (ST.all_min() >= 0){
      cout << '<' << endl;
    } else if (ST.all_max() <= 0){
      cout << '>' << endl;
    } else {
      cout << '?' << endl;
    }
  }
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 224 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 22 ms 712 KB Output is correct
11 Correct 115 ms 1952 KB Output is correct
12 Correct 186 ms 3552 KB Output is correct
13 Correct 224 ms 3520 KB Output is correct
14 Correct 213 ms 3568 KB Output is correct
15 Correct 201 ms 3684 KB Output is correct
16 Correct 198 ms 3532 KB Output is correct
17 Correct 220 ms 3564 KB Output is correct
18 Correct 205 ms 3556 KB Output is correct
19 Correct 209 ms 3568 KB Output is correct
20 Correct 212 ms 3576 KB Output is correct
21 Correct 207 ms 3532 KB Output is correct
22 Correct 205 ms 3560 KB Output is correct
23 Correct 217 ms 3532 KB Output is correct
24 Correct 206 ms 3560 KB Output is correct
25 Correct 205 ms 3568 KB Output is correct