oj.uz

Submission #836179

# Submission time Handle Problem Language Result Execution time Memory
836179 2023-08-24T08:25:52 Z gustason Minerals (JOI19_minerals) C++14
70 / 100
 40 ms 3464 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 = (int) floor((double) n * 0.6);
	//p(pirmas);
	//p(antras);
	
	assert(n != 0);
	if (n == 1) {
		Answer(pirmas[0], antras[0]);
		return;
	}
	
	if (flag) {
		m = n - m;
		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 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 7 ms 932 KB Output is correct
5 Correct 13 ms 1488 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct
19 Incorrect 40 ms 3464 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct
19 Incorrect 40 ms 3464 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct
19 Incorrect 40 ms 3464 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct
19 Incorrect 40 ms 3464 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 464 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 7 ms 932 KB Output is correct
9 Correct 13 ms 1488 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 14 ms 1604 KB Output is correct
13 Correct 15 ms 1504 KB Output is correct
14 Correct 17 ms 1488 KB Output is correct
15 Correct 39 ms 3420 KB Output is correct
16 Correct 37 ms 3344 KB Output is correct
17 Correct 34 ms 3308 KB Output is correct
18 Correct 36 ms 3180 KB Output is correct
19 Incorrect 40 ms 3464 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -