oj.uz

답안 #838877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
838877 2023-08-28T04:20:48 Z pavement Minerals (JOI19_minerals) C++17
75 / 100
 24 ms 3396 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair

void Solve(int N) {
	vector<int> uniq, others;
	for (int i = 0, prv = 0; i < 2 * N; i++) {
		if (Query(i + 1) > prv) {
			uniq.pb(i);
			prv++;
		} else {
			others.pb(i);
		}
	}
	int cur_l = 0, cur_r = N - 1, prv = N;
	vector<int> lo(2 * N, 0), hi(2 * N, N - 1), mid(2 * N), ans(2 * N, -1);
	
	auto shift = [&](int new_l, int new_r) {
		int tmp_new_l = new_l, tmp_new_r = new_r;
		assert(cur_l <= cur_r);
		assert(new_l <= new_r);
		if (new_l < cur_l) {
			swap(cur_l, new_l);
			swap(cur_r, new_r);
		}
		// case 1: one range compeletely covers the other
		if (new_r <= cur_r) {
			for (int i = cur_l; i < new_l; i++) {
				prv = Query(uniq[i] + 1);
			}
			for (int i = new_r + 1; i <= cur_r; i++) {
				prv = Query(uniq[i] + 1);
			}
		} else if (cur_r < new_l) {
			// case 2: completely disjoint
			for (int i = cur_l; i <= cur_r; i++) {
				prv = Query(uniq[i] + 1);
			}
			for (int i = new_l; i <= new_r; i++) {
				prv = Query(uniq[i] + 1);
			}
		} else {
			// intersection
			for (int i = cur_l; i < new_l; i++) {
				prv = Query(uniq[i] + 1);
			}
			for (int i = cur_r + 1; i <= new_r; i++) {
				prv = Query(uniq[i] + 1);
			}
		}
		cur_l = tmp_new_l;
		cur_r = tmp_new_r;
	};
	
	function<void(int, int, vector<int>&)> go = [&](int l, int r, vector<int> &idxs) {
		if (l > r || idxs.empty()) {
			return;
		}
		//~ cout << "@ " << l << ' ' << r << ": ";
		//~ for (auto i : idxs) {
			//~ cout << i << ' ';
		//~ }
		//~ cout << '\n';
		int m = (l + r) / 2;
		vector<int> left_half, right_half;
		shift(0, m);
		for (auto i : idxs) {
			int ret = Query(i + 1);
			if (ret == prv) {
				ans[i] = m;
				left_half.pb(i);
			} else {
				right_half.pb(i);
			}
			prv = ret;
		}
		go(l, m - 1, left_half);
		go(m + 1, r, right_half);
	};
	
	go(0, N - 1, others);
	
	for (int i : others) {
		//~ cout << "ANSWER " << i + 1 << ' ' << uniq[ans[i]] + 1 << '\n';
		Answer(i + 1, uniq[ans[i]] + 1);
	}
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 6 ms 936 KB Output is correct
5 Correct 7 ms 1360 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct
19 Correct 20 ms 3300 KB Output is correct
20 Correct 20 ms 3252 KB Output is correct
21 Correct 19 ms 3396 KB Output is correct
22 Correct 20 ms 3280 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct
19 Correct 20 ms 3300 KB Output is correct
20 Correct 20 ms 3252 KB Output is correct
21 Correct 19 ms 3396 KB Output is correct
22 Correct 20 ms 3280 KB Output is correct
23 Incorrect 20 ms 3180 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct
19 Correct 20 ms 3300 KB Output is correct
20 Correct 20 ms 3252 KB Output is correct
21 Correct 19 ms 3396 KB Output is correct
22 Correct 20 ms 3280 KB Output is correct
23 Incorrect 20 ms 3180 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct
19 Correct 20 ms 3300 KB Output is correct
20 Correct 20 ms 3252 KB Output is correct
21 Correct 19 ms 3396 KB Output is correct
22 Correct 20 ms 3280 KB Output is correct
23 Incorrect 20 ms 3180 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 7 ms 1440 KB Output is correct
13 Correct 7 ms 1424 KB Output is correct
14 Correct 6 ms 1360 KB Output is correct
15 Correct 24 ms 3264 KB Output is correct
16 Correct 20 ms 3188 KB Output is correct
17 Correct 17 ms 3360 KB Output is correct
18 Correct 20 ms 3280 KB Output is correct
19 Correct 20 ms 3300 KB Output is correct
20 Correct 20 ms 3252 KB Output is correct
21 Correct 19 ms 3396 KB Output is correct
22 Correct 20 ms 3280 KB Output is correct
23 Incorrect 20 ms 3180 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -