oj.uz

Submission #775501

# Submission time Handle Problem Language Result Execution time Memory
775501 2023-07-06T13:02:18 Z Cookie RMQ (NOI17_rmq) C++14
100 / 100
 79 ms 19760 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HAMMING.INP");
ofstream fout("HAMMING.OUT");
#define sz(a) (int)a.size()
#define int long long
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
 const ll mod = 1e9 + 7,inf = 2e9;
const int mxn = 2e5 + 5, sq = 400, mxv = 1e6 + 5;
int n, q;
pii st[4 * mxn + 1];
int lid[mxn + 1], rid[mxn + 1];
void upd(int nd, int l, int r, int id, int v){
    if(id < l || id > r)return;
    if(l == r){
        st[nd] = make_pair(v, id); return;
    }
    int mid = (l + r) >> 1;
    upd(nd << 1, l, mid, id, v); upd(nd << 1 | 1, mid + 1, r, id, v);
    st[nd] = min(st[nd << 1], st[nd << 1 | 1]);
}
pii get(int nd, int l, int r, int ql, int qr){
    if(ql <= l && qr >= r)return(st[nd]);
    int mid = (l + r) >> 1;
    if(qr <= mid){
        return(get(nd << 1, l, mid, ql, qr));
    }else if(ql > mid){
        return(get(nd << 1 | 1, mid + 1, r, ql, qr));
    }else{
        return(min(get(nd << 1, l, mid, ql, qr), get(nd << 1 | 1, mid + 1, r, ql, qr)));
    }
}
vt<pii>events[mxn + 1];
int ans[mxn + 1];
void no(){
    for(int i = 0; i < n; i++)cout << -1 << " ";
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q;
    for(int i = 0; i < n; i++){
        lid[i] = 0; rid[i] = n - 1;
    }
    for(int i = 0; i < q; i++){
        int l, r, v; cin >> l >> r >> v;
        lid[v] = max(lid[v], l); rid[v] = min(rid[v], r);
        events[l].pb({1, v}); events[r + 1].pb({-1, v});
    }
    
    multiset<int>ms;
    ms.insert(0);
    for(int i = 0; i < n; i++){
        for(auto [type, v]: events[i]){
            if(type == 1){
                ms.insert(v);
            }else{
                ms.erase(ms.find(v));
            }
        }
        upd(1, 0, n - 1, i, *ms.rbegin());
    }
    
    for(int i = 0; i < n; i++){
        if(lid[i] > rid[i]){
            no();
            return(0);
        }else{
            pii val = get(1, 0, n - 1, lid[i], rid[i]);
            if(val.first > i){
                no();
                return(0);
            }else{
                ans[val.second] = i;
                upd(1, 0, n - 1, val.second, inf);
            }
        }
    }
    for(int i = 0; i < n; i++){
        cout << ans[i] << " ";
    }
    
    return(0);
}

Compilation message

rmq.cpp: In function 'int main()':
rmq.cpp:69:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |         for(auto [type, v]: events[i]){
      |                  ^

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 5036 KB Output is correct
11 Correct 3 ms 5040 KB Output is correct

Subtask #2
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 5036 KB Output is correct
11 Correct 3 ms 5040 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5172 KB Output is correct
17 Correct 3 ms 5176 KB Output is correct
18 Correct 3 ms 5168 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 5036 KB Output is correct
11 Correct 3 ms 5040 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5172 KB Output is correct
17 Correct 3 ms 5176 KB Output is correct
18 Correct 3 ms 5168 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 75 ms 19760 KB Output is correct
28 Correct 73 ms 18688 KB Output is correct
29 Correct 62 ms 16964 KB Output is correct
30 Correct 75 ms 19512 KB Output is correct
31 Correct 79 ms 15692 KB Output is correct
32 Correct 64 ms 18892 KB Output is correct
33 Correct 28 ms 11488 KB Output is correct
34 Correct 20 ms 8752 KB Output is correct
35 Correct 48 ms 12604 KB Output is correct
36 Correct 54 ms 15692 KB Output is correct
37 Correct 71 ms 18028 KB Output is correct
38 Correct 18 ms 9940 KB Output is correct
39 Correct 55 ms 17100 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct