oj.uz

Submission #836170

# Submission time Handle Problem Language Result Execution time Memory
836170 2023-08-24T08:19:21 Z gustason Minerals (JOI19_minerals) C++14
80 / 100
 42 ms 3400 KB 
#include <bits/stdc++.h>
#include "minerals.h"

using namespace std;

int last = 0;

bool ask(int x) {
	int now = Query(x);
	bool ar_naujas = (now != last);
	last = now;
	return ar_naujas;
}

#define p(x) cout << (#x) << ":\n";print(x)

void print(vector<int>& a) {
	for(int i : a) {
		cout << i << " ";
	} 
	cout << "\n";
}

void go(vector<int> pirmas, vector<int> antras, bool flag=false) {
	int n = pirmas.size(), m = n/2;
	//p(pirmas);
	//p(antras);
	
	assert(n != 0);
	if (n == 1) {
		Answer(pirmas[0], antras[0]);
		return;
	}
	
	if (flag) {
		for(int i = m; i < n; i++) {
			ask(pirmas[i]);
		}
	}
	else {
		for(int i = 0; i < m; i++) {
			ask(pirmas[i]);
		}
	}
	
	vector<int> naujas_pirmas, naujas_antras;
	random_shuffle(antras.begin(), antras.end());
	for(const auto& i : antras) {
		if ((int) naujas_pirmas.size() == n) {
			naujas_antras.push_back(i);
		}
		else if ((int) naujas_antras.size() == n-m) {
			naujas_pirmas.push_back(i);
		}
		else if (ask(i)) {
			naujas_antras.push_back(i);
		}
		else {
			naujas_pirmas.push_back(i);
		}
	}
	
	vector<int> half, other_half;
	for(int i = 0; i < n; i++) {
		if (i < m) {
			half.push_back(pirmas[i]);
		}
		else {
			other_half.push_back(pirmas[i]);
		}
	}
	
	//p(half);
	//p(naujas_pirmas);
	//p(other_half);
	//p(naujas_antras);
	
	go(half, naujas_pirmas, true);
	go(other_half, naujas_antras);
}

void Solve(int N) {
	vector<int> pirmas, antras;
	for(int i = 1; i <= 2*N; i++) {
		if (ask(i)) {
			pirmas.push_back(i);
		}
		else {
			antras.push_back(i);
		}
	}
	
	go(pirmas, antras, true);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 7 ms 848 KB Output is correct
5 Correct 14 ms 1308 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct
19 Correct 35 ms 3168 KB Output is correct
20 Correct 36 ms 3272 KB Output is correct
21 Correct 34 ms 3228 KB Output is correct
22 Correct 36 ms 3020 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct
19 Correct 35 ms 3168 KB Output is correct
20 Correct 36 ms 3272 KB Output is correct
21 Correct 34 ms 3228 KB Output is correct
22 Correct 36 ms 3020 KB Output is correct
23 Correct 36 ms 3248 KB Output is correct
24 Correct 42 ms 3272 KB Output is correct
25 Correct 36 ms 3268 KB Output is correct
26 Correct 36 ms 3144 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct
19 Correct 35 ms 3168 KB Output is correct
20 Correct 36 ms 3272 KB Output is correct
21 Correct 34 ms 3228 KB Output is correct
22 Correct 36 ms 3020 KB Output is correct
23 Correct 36 ms 3248 KB Output is correct
24 Correct 42 ms 3272 KB Output is correct
25 Correct 36 ms 3268 KB Output is correct
26 Correct 36 ms 3144 KB Output is correct
27 Incorrect 36 ms 3400 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct
19 Correct 35 ms 3168 KB Output is correct
20 Correct 36 ms 3272 KB Output is correct
21 Correct 34 ms 3228 KB Output is correct
22 Correct 36 ms 3020 KB Output is correct
23 Correct 36 ms 3248 KB Output is correct
24 Correct 42 ms 3272 KB Output is correct
25 Correct 36 ms 3268 KB Output is correct
26 Correct 36 ms 3144 KB Output is correct
27 Incorrect 36 ms 3400 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 14 ms 1308 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Correct 14 ms 1360 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 42 ms 3208 KB Output is correct
16 Correct 34 ms 3284 KB Output is correct
17 Correct 33 ms 3148 KB Output is correct
18 Correct 33 ms 3004 KB Output is correct
19 Correct 35 ms 3168 KB Output is correct
20 Correct 36 ms 3272 KB Output is correct
21 Correct 34 ms 3228 KB Output is correct
22 Correct 36 ms 3020 KB Output is correct
23 Correct 36 ms 3248 KB Output is correct
24 Correct 42 ms 3272 KB Output is correct
25 Correct 36 ms 3268 KB Output is correct
26 Correct 36 ms 3144 KB Output is correct
27 Incorrect 36 ms 3400 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -