oj.uz

Submission #706199

# Submission time Handle Problem Language Result Execution time Memory
706199 2023-03-06T04:37:56 Z alvingogo Minerals (JOI19_minerals) C++14
90 / 100
 49 ms 2796 KB 
#include <bits/stdc++.h>
#include "minerals.h"
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

/* Mineral:
i can only figure out that merge sort might be a useful idea

but it is 3/2 * n * log(n) = 1.5 * 43000 * 15 = 2.25 * 43000 = oh wow, i can't math

so the first thing is to find out n minerals which satisfies that no two minerals share the same type

which can be done in n steps

after that, we can merge sort it
let the two parts be X, Y, both have size n
1. put the first n/2 numbers in x to set
2. put every numbers in Y to set, check the answer being changed
3. for every numbers in Y which not causes the answer changed, pop out it from the set
4. go to the next two parts
it's 2*n?
no, for the next level, for one part we can see it as we have done the first step to Y
and for another we just think it the same

so let's go!!

3/2 * 43000 * 15 = 967500
1031500


the recursive function might code in this way:
f(X,Y,flag)
which flag = 0 -> we should do the first step
flag = 1 -> we shouldn't do

and oh, to find out if the correspond is in the first step 
we can check if Query() is same to the original answer

done!

*/

int ans=0;
void f(vector<int>& x,vector<int>& y,int flag){
	int n=x.size();
	if(n==1){
		Answer(x[0],y[0]);
		return;
	}
	vector<int> a,b,c,d;
	int p=n/2,q=n-p;
	for(int i=0;i<n/2;i++){
		ans=Query(x[i]);
	}
	for(int i=0;i<n/2;i++){
		a.push_back(x[i]);
	}
	for(int i=n/2;i<n;i++){
		b.push_back(x[i]);
	}
	for(int i=0;i<n;i++){
		if(p==0){
			q--;
			d.push_back(y[i]);
			continue;
		}
		if(q==0){
			p--;
			c.push_back(y[i]);
			continue;
		}
		int e=Query(y[i]);
		if((e==ans) xor flag){
			c.push_back(y[i]);
			p--;
		}
		else{
			d.push_back(y[i]);
			q--;
		}
		ans=e;
	}
	f(a,c,flag^1);
	f(b,d,flag);
}
mt19937 rnd(time(NULL));
void Solve(int n){
	vector<int> x,y;
	for(int i=1;i<=2*n;i++){
		int z=Query(i);
		if(ans!=z){
			x.push_back(i);
		}
		else{
			y.push_back(i);
		}
		ans=z;
	}
	shuffle(x.begin(),x.end(),rnd);
	shuffle(y.begin(),y.end(),rnd);
	f(x,y,1);
}

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 336 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 8 ms 720 KB Output is correct
5 Correct 17 ms 1108 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct

Subtask #5
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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct
19 Correct 42 ms 2528 KB Output is correct
20 Correct 42 ms 2520 KB Output is correct
21 Correct 43 ms 2632 KB Output is correct
22 Correct 41 ms 2508 KB Output is correct

Subtask #6
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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct
19 Correct 42 ms 2528 KB Output is correct
20 Correct 42 ms 2520 KB Output is correct
21 Correct 43 ms 2632 KB Output is correct
22 Correct 41 ms 2508 KB Output is correct
23 Correct 42 ms 2632 KB Output is correct
24 Correct 43 ms 2640 KB Output is correct
25 Correct 41 ms 2660 KB Output is correct
26 Correct 47 ms 2568 KB Output is correct

Subtask #7
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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct
19 Correct 42 ms 2528 KB Output is correct
20 Correct 42 ms 2520 KB Output is correct
21 Correct 43 ms 2632 KB Output is correct
22 Correct 41 ms 2508 KB Output is correct
23 Correct 42 ms 2632 KB Output is correct
24 Correct 43 ms 2640 KB Output is correct
25 Correct 41 ms 2660 KB Output is correct
26 Correct 47 ms 2568 KB Output is correct
27 Correct 46 ms 2640 KB Output is correct
28 Correct 47 ms 2668 KB Output is correct
29 Correct 41 ms 2724 KB Output is correct
30 Correct 47 ms 2556 KB Output is correct

Subtask #8
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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct
19 Correct 42 ms 2528 KB Output is correct
20 Correct 42 ms 2520 KB Output is correct
21 Correct 43 ms 2632 KB Output is correct
22 Correct 41 ms 2508 KB Output is correct
23 Correct 42 ms 2632 KB Output is correct
24 Correct 43 ms 2640 KB Output is correct
25 Correct 41 ms 2660 KB Output is correct
26 Correct 47 ms 2568 KB Output is correct
27 Correct 46 ms 2640 KB Output is correct
28 Correct 47 ms 2668 KB Output is correct
29 Correct 41 ms 2724 KB Output is correct
30 Correct 47 ms 2556 KB Output is correct
31 Correct 44 ms 2676 KB Output is correct
32 Correct 44 ms 2672 KB Output is correct
33 Correct 49 ms 2760 KB Output is correct
34 Correct 43 ms 2580 KB Output is correct

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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 14 ms 1112 KB Output is correct
13 Correct 13 ms 1052 KB Output is correct
14 Correct 15 ms 1108 KB Output is correct
15 Correct 44 ms 2520 KB Output is correct
16 Correct 46 ms 2576 KB Output is correct
17 Correct 42 ms 2520 KB Output is correct
18 Correct 38 ms 2384 KB Output is correct
19 Correct 42 ms 2528 KB Output is correct
20 Correct 42 ms 2520 KB Output is correct
21 Correct 43 ms 2632 KB Output is correct
22 Correct 41 ms 2508 KB Output is correct
23 Correct 42 ms 2632 KB Output is correct
24 Correct 43 ms 2640 KB Output is correct
25 Correct 41 ms 2660 KB Output is correct
26 Correct 47 ms 2568 KB Output is correct
27 Correct 46 ms 2640 KB Output is correct
28 Correct 47 ms 2668 KB Output is correct
29 Correct 41 ms 2724 KB Output is correct
30 Correct 47 ms 2556 KB Output is correct
31 Correct 44 ms 2676 KB Output is correct
32 Correct 44 ms 2672 KB Output is correct
33 Correct 49 ms 2760 KB Output is correct
34 Correct 43 ms 2580 KB Output is correct
35 Incorrect 45 ms 2796 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -