oj.uz

Submission #90490

# Submission time Handle Problem Language Result Execution time Memory
90490 2018-12-21T21:03:28 Z xiaowuc1 Trading (IZhO13_trading) C++14
100 / 100
 212 ms 10532 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;

int lazy[1200000];
int sz = 300000;
void update(int idx, int l, int r, int lhs, int rhs, int v) {
  if(l >= lhs && r <= rhs) {
    lazy[idx] = max(lazy[idx], v);
    return;
  }
  lazy[2*idx] = max(lazy[2*idx], lazy[idx]);
  lazy[2*idx+1] = max(lazy[2*idx+1], lazy[idx]);
  int m = (l+r)/2;
  if(m >= lhs) update(2*idx, l, m, lhs, rhs, v);
  if(m+1 <= rhs) update(2*idx+1, m+1, r, lhs, rhs, v);
}
void update(int l, int r, int v) {
  update(1, 1, sz, l, r, v);
}
void solve(int idx, int l, int r, vector<int>& ret) {
  if(l == r) {
    ret.push_back(max(0, l + lazy[idx]));
    return;
  }
  lazy[2*idx] = max(lazy[2*idx], lazy[idx]);
  lazy[2*idx+1] = max(lazy[2*idx+1], lazy[idx]);
  int m = (l+r)/2;
  solve(2*idx, l, m, ret);
  solve(2*idx+1, m+1, r, ret);
}
void solve(vector<int>& ret) {
  solve(1, 1, sz, ret);
}

void solve() {
  int n, m;
  cin >> n >> m;
  for(int i = 1; i < 1200000; i++) lazy[i] = -1e9;
  while(m--) {
    int l, r, x;
    cin >> l >> r >> x;
    update(l, r, x-l);
  }
  vector<int> ret;
  ret.reserve(n);
  solve(ret);
  for(int i = 1; i <= n; i++) {
    cout << ret[i-1];
    if(i == n) cout << endl;
    else cout << " ";
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL);
  solve();
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7024 KB Output is correct
2 Correct 11 ms 7024 KB Output is correct
3 Correct 11 ms 7024 KB Output is correct
4 Correct 11 ms 7024 KB Output is correct
5 Correct 12 ms 7024 KB Output is correct
6 Correct 13 ms 7024 KB Output is correct
7 Correct 101 ms 9452 KB Output is correct
8 Correct 110 ms 9756 KB Output is correct
9 Correct 115 ms 9756 KB Output is correct
10 Correct 124 ms 9756 KB Output is correct
11 Correct 135 ms 10128 KB Output is correct
12 Correct 144 ms 10128 KB Output is correct
13 Correct 149 ms 10160 KB Output is correct
14 Correct 148 ms 10160 KB Output is correct
15 Correct 163 ms 10212 KB Output is correct
16 Correct 186 ms 10212 KB Output is correct
17 Correct 173 ms 10256 KB Output is correct
18 Correct 194 ms 10352 KB Output is correct
19 Correct 181 ms 10352 KB Output is correct
20 Correct 212 ms 10532 KB Output is correct