oj.uz

답안 #891408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891408 2023-12-22T21:59:16 Z stefanneagu RMQ (NOI17_rmq) C++17
100 / 100
 104 ms 13480 KB 
#include <bits/stdc++.h>

using namespace std;

const int nmax = 1e5 + 1;

struct str {
  int a, b, val;
  const bool operator < (str ult) const {
    return val < ult.val;
  }
} v[nmax];

int aint[4 * nmax], lz[4 * nmax], fp[nmax], lp[nmax], fin[nmax];
vector<vector<int>> place;

void lazy(int nod, int st, int dr) {
  aint[nod] = lz[nod];
  if(st != dr) {
    lz[nod << 1] = lz[nod];
    lz[nod << 1|1] = lz[nod];
  }
  lz[nod] = 0;
}

void update(int nod, int st, int dr, int l, int r, int val) {
  if(lz[nod]) {
    lazy(nod, st, dr);
  }
  if(st > r || dr < l) {
    return;
  }
  if(l <= st && dr <= r) {
    lz[nod] = val;
    lazy(nod, st, dr);
    return;
  }
  int mid = (st + dr) / 2;
  update(nod << 1, st, mid, l, r, val);
  update(nod << 1|1, mid + 1, dr, l, r, val);
}

int query(int nod, int st, int dr, int poz) {
  if(lz[nod]) {
    lazy(nod, st, dr);
  }
  if(st == dr) {
    return aint[nod];
  }
  int mid = (st + dr) / 2;
  if(poz <= mid) {
    return query(nod << 1, st, mid, poz);
  } else {
    return query(nod << 1|1, mid + 1, dr, poz);
  }
}

int main() {
  int n, q;
  cin >> n >> q;
  for(int i = 0; i <= n; i ++) {
    fp[i] = 1, lp[i] = n;
  }
  for(int i = 1; i <= q; i ++) {
    int a, b, val;
    cin >> a >> b >> val;
    a ++;
    b ++;
    v[i].a = a, v[i].b = b, v[i].val = val;
    fp[val] = max(fp[val], a);
    lp[val] = min(lp[val], b);
  }
  sort(v + 1, v + q + 1);
  for(int i = 1; i <= q; i ++) {
    update(1, 1, n, v[i].a, v[i].b, v[i].val);
  }
  place.resize(n + 1);
  for(int i = 1; i <= n; i ++) {
    int x = query(1, 1, n, i);
    place[x].push_back(i);
  }
  set<int> curr;
  for(int i = 0; i < n; i ++) {
    for(auto it : place[i]) {
      curr.insert(it);
    }
    auto poz = curr.lower_bound(fp[i]);
    if(poz == curr.end() || (*poz) > lp[i]) {
      for(int x = 1; x <= n; x ++) {
        cout << "-1 ";
      }
      return 0;
    }
    fin[(*poz)] = i;
    curr.erase(poz);
  }
  for(int i = 1; i <= n; i ++) {
    cout << fin[i] << " ";
  }
  return 0;
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4484 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct

Subtask #2
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4484 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4620 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4552 KB Output is correct
21 Correct 1 ms 4520 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 1 ms 4540 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4484 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4620 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4552 KB Output is correct
21 Correct 1 ms 4520 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 1 ms 4540 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 104 ms 12416 KB Output is correct
28 Correct 90 ms 13000 KB Output is correct
29 Correct 76 ms 12272 KB Output is correct
30 Correct 102 ms 13480 KB Output is correct
31 Correct 82 ms 11544 KB Output is correct
32 Correct 91 ms 11724 KB Output is correct
33 Correct 23 ms 11224 KB Output is correct
34 Correct 15 ms 9048 KB Output is correct
35 Correct 32 ms 12284 KB Output is correct
36 Correct 61 ms 8788 KB Output is correct
37 Correct 88 ms 9488 KB Output is correct
38 Correct 7 ms 6488 KB Output is correct
39 Correct 72 ms 9112 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct