oj.uz

Submission #982437

# Submission time Handle Problem Language Result Execution time Memory
982437 2024-05-14T09:02:08 Z yhkhoo Minerals (JOI19_minerals) C++17
85 / 100
 38 ms 3976 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define fi first
#define se second

vector<bool> mmm;
vector<int> ran;
inline int query(int i){
	mmm[i] = !mmm[i];
	i = ran[i];
	return Query(i);
}

void Solve(int N) {
	ran.reserve(2*N+1);
	for(int i=1; i<=2*N; i++){
		ran[i] = i;
	}
	random_device rd;
    mt19937 g(rd());
	shuffle(ran.begin(), ran.end(), g);
	mmm.resize(2*N+1);
	vector<int> x, y, hint(N, N-1);
	x.reserve(N);
	y.reserve(N);
	int pre = 0;
	for(int i=1; i<=2*N; i++){
		int cur = query(i);
		if(x.size() == N){
			y.pb(i);
			continue;
		}
		if(cur == pre){
			y.pb(i);
			//cerr << " y" << i;
			hint[y.size()-1] = x.size()-1;
		}
		else{
			x.pb(i);
			//cerr << " x" << i;
		}
		pre = cur;
	}
	//cerr << '\n';
	map<pii, vector<int>> sex;
	int prel = 0, prer = N-1;
	vector<int> l(N, 0), r(N, N-1)/*, m(N, N/2)*/;
	for(int i=0; i<N; i++){
		if(l[i] < r[i]) sex[mp(l[i], r[i])].pb(i);
	}
	int orig;
	while(sex.size()){
		/*cerr << '\n';
		for(int i=0; i<N; i++){
			cerr << i << ' ' << l[i] << ' ' << r[i] << '\n';
		}
		cerr << '\n';*/
		auto segp = sex.begin();
		auto seg = *segp;
		auto [cl, cr] = seg.fi;
		int cm = (cl + cr)/2;
		for(int i=cl; i<=cm; i++){
			if(i < prel || i > prer) orig = query(x[i]);
		}
		for(int i=prel; i<=prer; i++){
			if(i < cl || i > cm) orig = query(x[i]);
		}
		prel = cl;
		prer = cm;
		int lc = 0, rc = 0;
		for(auto i: seg.se){
			if(lc == cm-cl+1){
				l[i] = cm+1;
				rc++;
			}
			else if(rc == cr-cm){
				r[i] = cm;
				lc++;
			}
			else if(hint[i] <= cm){
				//cerr << "to the left (hint)";
				r[i] = cm;
				lc++;
			}
			else{
				//cerr << seg.fi.fi << ' ' << seg.fi.se << ' ' << m << '\n';
				//cerr << i << '\n';
				int cur = query(y[i]);
				/*for(int i=1; i<=2*N; i++){
					cerr << mmm[i];
				}*/
				//cerr << '\n';
				if(cur == orig){
					//cerr << "to the left";
					r[i] = cm;
					lc++;
				}
				else{
					//cerr << "to the right";
					l[i] = cm+1;
					rc++;
				}
				orig = cur;
				//query(y[i]);
				//cerr << ".\n";
			}
			if(l[i] < r[i]){
				sex[mp(l[i], r[i])].pb(i);
			}
		}
		sex.erase(segp);
	}
	/*for(int i=0; i<N; i++){
		cerr << y[i] << ' ' << x[l[i]] << '\n';
	}*/
	for(int i=0; i<N; i++){
		Answer(y[i], x[l[i]]);
	}
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:34:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |   if(x.size() == N){
      |      ~~~~~~~~~^~~~
minerals.cpp:98:5: warning: 'orig' may be used uninitialized in this function [-Wmaybe-uninitialized]
   98 |     if(cur == orig){
      |     ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 6 ms 764 KB Output is correct
5 Correct 11 ms 1372 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct
19 Correct 34 ms 3100 KB Output is correct
20 Correct 34 ms 3108 KB Output is correct
21 Correct 20 ms 3572 KB Output is correct
22 Correct 22 ms 3116 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct
19 Correct 34 ms 3100 KB Output is correct
20 Correct 34 ms 3108 KB Output is correct
21 Correct 20 ms 3572 KB Output is correct
22 Correct 22 ms 3116 KB Output is correct
23 Correct 38 ms 3976 KB Output is correct
24 Correct 36 ms 3108 KB Output is correct
25 Correct 20 ms 3252 KB Output is correct
26 Correct 23 ms 3108 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct
19 Correct 34 ms 3100 KB Output is correct
20 Correct 34 ms 3108 KB Output is correct
21 Correct 20 ms 3572 KB Output is correct
22 Correct 22 ms 3116 KB Output is correct
23 Correct 38 ms 3976 KB Output is correct
24 Correct 36 ms 3108 KB Output is correct
25 Correct 20 ms 3252 KB Output is correct
26 Correct 23 ms 3108 KB Output is correct
27 Correct 36 ms 3288 KB Output is correct
28 Correct 36 ms 3360 KB Output is correct
29 Correct 24 ms 3416 KB Output is correct
30 Correct 22 ms 3556 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct
19 Correct 34 ms 3100 KB Output is correct
20 Correct 34 ms 3108 KB Output is correct
21 Correct 20 ms 3572 KB Output is correct
22 Correct 22 ms 3116 KB Output is correct
23 Correct 38 ms 3976 KB Output is correct
24 Correct 36 ms 3108 KB Output is correct
25 Correct 20 ms 3252 KB Output is correct
26 Correct 23 ms 3108 KB Output is correct
27 Correct 36 ms 3288 KB Output is correct
28 Correct 36 ms 3360 KB Output is correct
29 Correct 24 ms 3416 KB Output is correct
30 Correct 22 ms 3556 KB Output is correct
31 Incorrect 36 ms 3212 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 6 ms 764 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 12 ms 1368 KB Output is correct
13 Correct 8 ms 1684 KB Output is correct
14 Correct 8 ms 1368 KB Output is correct
15 Correct 33 ms 3028 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 21 ms 3196 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct
19 Correct 34 ms 3100 KB Output is correct
20 Correct 34 ms 3108 KB Output is correct
21 Correct 20 ms 3572 KB Output is correct
22 Correct 22 ms 3116 KB Output is correct
23 Correct 38 ms 3976 KB Output is correct
24 Correct 36 ms 3108 KB Output is correct
25 Correct 20 ms 3252 KB Output is correct
26 Correct 23 ms 3108 KB Output is correct
27 Correct 36 ms 3288 KB Output is correct
28 Correct 36 ms 3360 KB Output is correct
29 Correct 24 ms 3416 KB Output is correct
30 Correct 22 ms 3556 KB Output is correct
31 Incorrect 36 ms 3212 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -