oj.uz

Submission #991188

# Submission time Handle Problem Language Result Execution time Memory
991188 2024-06-01T14:15:43 Z tch1cherin Trading (IZhO13_trading) C++17
0 / 100
 1 ms 348 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<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]);
  }
  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 (int x : add[i]) {
      S.insert(x);
    }
    cout << (S.empty() ? 0 : *S.rbegin() + i) << " \n"[i + 1 == N];
    if (R[i] < N) {
      events[R[i]].push_back(X[i] - L[i]);
    }
  }
}

Subtask #1
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 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -