oj.uz

Submission #706196

# Submission time Handle Problem Language Result Execution time Memory
706196 2023-03-06T04:32:50 Z alvingogo Minerals (JOI19_minerals) C++14
80 / 100
 40 ms 2764 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;
	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++){
		int e=Query(y[i]);
		if((e==ans) xor flag){
			c.push_back(y[i]);
		}
		else{
			d.push_back(y[i]);
		}
		ans=e;
	}
	f(a,c,flag^1);
	f(b,d,flag);
}
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;
	}
	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 1 ms 296 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 800 KB Output is correct
5 Correct 13 ms 976 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 KB Output is correct
19 Correct 35 ms 2764 KB Output is correct
20 Correct 40 ms 2648 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 34 ms 2404 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 KB Output is correct
19 Correct 35 ms 2764 KB Output is correct
20 Correct 40 ms 2648 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 34 ms 2404 KB Output is correct
23 Correct 40 ms 2684 KB Output is correct
24 Correct 39 ms 2664 KB Output is correct
25 Correct 30 ms 2540 KB Output is correct
26 Correct 31 ms 2484 KB Output is correct

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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 KB Output is correct
19 Correct 35 ms 2764 KB Output is correct
20 Correct 40 ms 2648 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 34 ms 2404 KB Output is correct
23 Correct 40 ms 2684 KB Output is correct
24 Correct 39 ms 2664 KB Output is correct
25 Correct 30 ms 2540 KB Output is correct
26 Correct 31 ms 2484 KB Output is correct
27 Incorrect 35 ms 2648 KB Wrong Answer [2]
28 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 KB Output is correct
19 Correct 35 ms 2764 KB Output is correct
20 Correct 40 ms 2648 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 34 ms 2404 KB Output is correct
23 Correct 40 ms 2684 KB Output is correct
24 Correct 39 ms 2664 KB Output is correct
25 Correct 30 ms 2540 KB Output is correct
26 Correct 31 ms 2484 KB Output is correct
27 Incorrect 35 ms 2648 KB Wrong Answer [2]
28 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 1 ms 296 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 800 KB Output is correct
9 Correct 13 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 14 ms 1064 KB Output is correct
14 Correct 10 ms 976 KB Output is correct
15 Correct 34 ms 2576 KB Output is correct
16 Correct 39 ms 2500 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 27 ms 2260 KB Output is correct
19 Correct 35 ms 2764 KB Output is correct
20 Correct 40 ms 2648 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 34 ms 2404 KB Output is correct
23 Correct 40 ms 2684 KB Output is correct
24 Correct 39 ms 2664 KB Output is correct
25 Correct 30 ms 2540 KB Output is correct
26 Correct 31 ms 2484 KB Output is correct
27 Incorrect 35 ms 2648 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -