oj.uz

답안 #279945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
279945 2020-08-22T12:15:13 Z Haunted_Cpp RMQ (NOI17_rmq) C++17
23 / 100
 49 ms 392 KB 
/**
 *  author: Haunted_Cpp
**/
 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
 
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
 
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif

class SegmentTree {
private:
  struct Node {
    int mn, lazy;
    Node() {
      mn = 1e9;
      lazy = -1;
    }
  };
  const int LO, HI;
  vector<Node> seg;
  void push(int l, int r, int node) {
    if (seg[node].lazy == -1) return;
    seg[node].mn = seg[node].lazy;
    if (l != r) {
      seg[2 * node + 1].lazy = seg[node].lazy;
      seg[2 * node + 2].lazy = seg[node].lazy;
    }
    seg[node].lazy = -1;
  }
  void range_set(int ql, int qr, int delta, int l, int r, int node) {
    push(l, r, node);
    if (l > qr || r < ql) return;
    if (l >= ql && r <= qr) {
      seg[node].lazy = delta;
      push(l, r, node);
      return;
    }
    const int mid = l + (r - l) / 2;
    range_set(ql, qr, delta, l, mid, 2 * node + 1);
    range_set(ql, qr, delta, mid + 1, r, 2 * node + 2);
    seg[node].mn = min(seg[2 * node + 1].mn, seg[2 * node + 2].mn);
  }
  void solve(int l, int r, int node) {
    push(l, r, node);
    if (l == r) {
      cout << seg[node].mn << ' ';
      return;
    }
    const int mid = l + (r - l) / 2;
    solve(l, mid, 2 * node + 1);
    solve(mid + 1, r, 2 * node + 2);
  }
public:
  SegmentTree(int n) : LO(0), HI(n - 1) {
    seg.clear();
    seg.resize(4 * n);
  }
  void range_set(int ql, int qr, int delta) {
    range_set(ql, qr, delta, LO, HI, 0);
  }
  void solve() {
    solve(LO, HI, 0);
  }
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0); 
  int n, m;
  cin >> n >> m;
  vector<tuple<int, int, int>> arr(m);
  for (int i = 0; i < m; i++) {
    int st, et, w;
    cin >> st >> et >> w;
    arr[i] = {st, et, w};
  }
  if (n <= 10) {
    vector<int> ans(n);
    iota(ans.begin(), ans.end(), 0);
    do {
      for (int i = 0; i < m; i++) {
        const int st = get<0>(arr[i]);
        const int et = get<1>(arr[i]);
        const int mn = get<2>(arr[i]);
        const int is = *min_element(ans.begin() + st, ans.begin() + et + 1);
        if (is != mn) {
          goto fim;
          break;
        }
      }
      for (auto to : ans) cout << to << ' ';
      return 0;
      fim:;
    } while(next_permutation(ans.begin(), ans.end()));
    for (int i = 0; i < n; i++) {
      cout << -1 << ' ';
    }
    return 0;
  } else {
    sort(arr.begin(), arr.end(), [&](auto x, auto y) {
      return get<2>(x) < get<2>(y);
    });
    SegmentTree seg(n);
    for (int i = 0; i < m; i++) {
      const int st = get<0>(arr[i]);
      const int et = get<1>(arr[i]);
      const int mn = get<2>(arr[i]);
      seg.range_set(st, et, mn);
    }
    seg.solve();
    cout << '\n';
  }
  return 0;
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 7 ms 392 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 39 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 49 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct

Subtask #2
0.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 7 ms 392 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 39 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 49 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Incorrect 1 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 7 ms 392 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 39 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 49 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Incorrect 1 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -