제출 #1193265

#제출 시각아이디문제언어결과실행 시간메모리
1193265lopkus원숭이와 사과 나무 (IZhO12_apple)C++20
0 / 100
2094 ms8296 KiB
#include <bits/stdc++.h>

#define int int64_t

const int N = 1e6 + 1;

std::vector<int> a(N);

void solve() {
  int m;
  std::cin >> m;
  int prv = 0;
  while(m--) {
    int type;
    std::cin >> type;
    if(type == 2) {
      int l, r;
      std::cin >> l >> r;
      l += prv;
      r += prv;
      for(int i = l; i <= r; i++) {
        a[i] = 1;
      }
    }
    else {
      int l, r;
      std::cin >> l >> r;
      l += prv;
      r += prv;
      int ans = 0;
      for(int i = l; i <= r; i++) {
        ans += a[i];
      }
      std::cout << ans << "\n";
      prv = ans;
    }
  }
}


signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...