답안 #391299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391299	2021-04-18T13:04:59 Z	BThero	RMQ (NOI17_rmq)	C++17	67 / 100	1000 ms	2620 KB

rmq

// chrono::system_clock::now().time_since_epoch().count()
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define debug(x) cerr << #x << " = " << x << endl

using namespace std;

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

const int MAXN = (int)1e5 + 5;

int lim[MAXN], ans[MAXN];
array<int, 3> que[MAXN];
pii seg[MAXN];
int n, q;

void solve() {
    cin >> n >> q;
    fill(seg, seg + n, mp(0, n - 1));

    rep (i, 0, q) {
        int l, r, x;
        cin >> l >> r >> x;
        que[i] = {l, r, x};
        seg[x].fi = max(seg[x].fi, l);
        seg[x].se = min(seg[x].se, r);

        rep (j, l, r + 1) {
            lim[j] = max(lim[j], x);
        }
    }

    fill(ans, ans + n, -1);

    rep (i, 0, n) {
        bool found = 0;

        rep (j, seg[i].fi, seg[i].se + 1) {
            if (ans[j] == -1 && lim[j] <= i) {
                ans[j] = i;
                found = 1;
                break;
            }
        }   

        if (!found) {
            rep (i, 0, n) {
                cout << -1 << " \n"[i == n - 1];
            }

            return;
        }
    }

    rep (i, 0, n) {
        cout << ans[i] << " \n"[i == n - 1];
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tt = 1;

    for (int i = 1; i <= tt; ++i) {
        solve();
    }

    return 0;
}

Subtask #1

23.0 / 23.0

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

Subtask #2

44.0 / 44.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct

Subtask #3

0.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Execution timed out	1088 ms	2620 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-