답안 #828823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828823	2023-08-17T16:47:42 Z	NK_	RMQ (NOI17_rmq)	C++17	100 / 100	116 ms	17700 KB

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using vi = V<int>;
using ll = long long;
using pi = pair<int, int>;
using vpi = V<pi>;
using vl = V<ll>;
using db = double;

const int INF = 1e9 + 10;

struct ST {
	int level(int x) { return 31 - __builtin_clz(x); }
	vi v; V<vi> jmp; int comb(int a, int b) { return min(a, b); }
	void init(const vi& _v) {
		v = _v; jmp = {v};
		for(int j = 1; (1<<j) <= sz(v); j++) {
			jmp.pb(vi(sz(v) - (1<<j) + 1));
			for(int i = 0; i < sz(jmp[j]); i++) jmp[j][i] = comb(jmp[j-1][i], jmp[j-1][i+(1<<(j-1))]);
		}
	}
	int query(int l, int r) {
		int d = level(r-l+1);
		return comb(jmp[d][l], jmp[d][r-(1<<d)+1]);
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
 	
	int N, Q; cin >> N >> Q;

	V<vi> E(N+1); V<array<int, 3>> q;
	vi amt(N);
	for(int i = 0; i < Q; i++) {
		int l, r, x; cin >> l >> r >> x; 
		amt[x]++; q.pb({l, r, x});
		E[l].pb(x);
		E[r+1].pb(~x);
	}

	auto impossible = [&]() {
		for(int i = 0; i < N; i++) cout << -1 << " ";
		cout << nl;
		exit(0-0);
	};

	set<int> have; 
	for(int i = 0; i < N; i++) have.insert(i);

	set<int> S = {-1}, G = {-1}; vi A(N), mn(N);

	vi C(N);
	for(int x = 0; x < N; x++) {
		for(auto& v : E[x]) {
			if (v < 0) {
				v = ~v;
				if (C[v] == amt[v]) G.erase(v);
				C[v]--;	
				if (C[v] == 0) S.erase(S.find(v));
			} else {
				if (C[v] == 0) S.insert(v);
				C[v]++;
				if (C[v] == amt[v]) { G.insert(v); if (have.count(v)) have.erase(v); }
			}
		}

		A[x] = *rbegin(G);
		mn[x] = *rbegin(S);
	}	

	C = vi(N, 0); for(auto x : A) if (x != -1) C[x]++;

	vi ord(N); iota(begin(ord), end(ord), 0);
	sort(begin(ord), end(ord), [&](int x, int y) { return mn[x] > mn[y]; });

	for(auto i : ord) {
		int x = A[i];
		if (x != -1 && C[x] == 1) continue;

		auto it = have.lower_bound(mn[i]);
		if (it == end(have)) continue;

		A[i] = *it; have.erase(it);
		if (x != -1) C[x]--;
	}

	ST st; st.init(A);
	for(int j = 0; j < Q; j++) {
		auto [l, r, x] = q[j];
		if (st.query(l, r) != x) impossible();
	}

	if (sz(have) != 0) impossible();

	for(auto x : A) cout << x << " ";
	cout << nl;

	exit(0-0);
}

Subtask #1
23.0 / 23.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct

Subtask #2
44.0 / 44.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	51 ms	11380 KB	Output is correct
28	Correct	46 ms	12372 KB	Output is correct
29	Correct	53 ms	11744 KB	Output is correct
30	Correct	50 ms	13092 KB	Output is correct
31	Correct	50 ms	10024 KB	Output is correct
32	Correct	41 ms	9856 KB	Output is correct
33	Correct	23 ms	9456 KB	Output is correct
34	Correct	15 ms	6452 KB	Output is correct
35	Correct	30 ms	11456 KB	Output is correct
36	Correct	94 ms	17700 KB	Output is correct
37	Correct	116 ms	17344 KB	Output is correct
38	Correct	20 ms	9144 KB	Output is correct
39	Correct	44 ms	12584 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct

답안 #828823

Compilation message

Subtask #1 23.0 / 23.0

Subtask #2 44.0 / 44.0

Subtask #3 33.0 / 33.0

Subtask #1
23.0 / 23.0

Subtask #2
44.0 / 44.0

Subtask #3
33.0 / 33.0