oj.uz

Submission #991190

# Submission time Handle Problem Language Result Execution time Memory
991190 2024-06-01T14:17:56 Z tch1cherin Trading (IZhO13_trading) C++17
100 / 100
 163 ms 39384 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<int> L(M), R(M), X(M);
  vector<vector<pair<int, int>>> add(N);
  for (int i = 0; i < M; i++) {
    cin >> L[i] >> R[i] >> X[i];
    L[i]--;
    add[L[i]].push_back({X[i] - L[i], R[i]});
  }
  vector<vector<int>> events(N);
  multiset<int> S;
  for (int i = 0; i < N; i++) {
    for (int x : events[i]) {
      S.erase(S.find(x));
    }
    for (auto [x, r] : add[i]) {
      S.insert(x);
      if (r < N) {
        events[r].push_back(x);
      }
    }
    cout << (S.empty() ? 0 : *S.rbegin() + i) << " \n"[i + 1 == N];
  }
}

Subtask #1
100.0 / 100.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 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 564 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 80 ms 20012 KB Output is correct
8 Correct 88 ms 22456 KB Output is correct
9 Correct 95 ms 23624 KB Output is correct
10 Correct 111 ms 25900 KB Output is correct
11 Correct 105 ms 27252 KB Output is correct
12 Correct 123 ms 29172 KB Output is correct
13 Correct 117 ms 29044 KB Output is correct
14 Correct 126 ms 31164 KB Output is correct
15 Correct 132 ms 32972 KB Output is correct
16 Correct 148 ms 33224 KB Output is correct
17 Correct 138 ms 33216 KB Output is correct
18 Correct 153 ms 36300 KB Output is correct
19 Correct 149 ms 35784 KB Output is correct
20 Correct 163 ms 39384 KB Output is correct