oj.uz

Submission #376779

# Submission time Handle Problem Language Result Execution time Memory
376779 2021-03-12T03:42:30 Z casperwang Minerals (JOI19_minerals) C++14
85 / 100
 71 ms 3820 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#define All(x) x.begin(), x.end()
#define pb emplace_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
 
int pre, now;
 
void check(vector <int> A, vector <int> B, bool flagA, bool flagB) {
	if (A.size() == 1) {
		Answer(A[0], B[0]);
		return;
	}
	int len = B.size() / 2;
	vector <int> LA, RA, LB, RB;
	for (int i = 0; i < len; i++) {
		pre = now;
		now = Query(B[i]);
		LB.pb(B[i]);
	}
	for (int i = len; i < B.size(); i++) {
		RB.pb(B[i]);
	}
	for (int i = 0; i < A.size(); i++) {
		pre = now;
		now = Query(A[i]);
		if ( (!flagA && !flagB && now == pre)
	  	|| (!flagA &&  flagB && now == pre+1)
	  	|| ( flagA && !flagB && now == pre)
			|| ( flagA &&  flagB && now == pre-1)) {
			LA.pb(A[i]);
		} else {
			RA.pb(A[i]);
		}
		if (LA.size() == len && !RA.size()) {
			for (int j = len; j < A.size(); j++)
				RA.pb(A[j]);
			check(LA, LB, !flagA, !flagB);
			check(RA, RB,  flagA,  flagB);
			return;
		}
		if (RA.size() == B.size()-len && !LA.size()) {
			for (int j = B.size()-len; j < A.size(); j++)
				LA.pb(A[j]);
			check(LA, LB,  flagA, !flagB);
			check(RA, RB, !flagA,  flagB);
			return;
		}
	}
	check(LA, LB, !flagA, !flagB);
	check(RA, RB, !flagA, flagB);
}
 
void Solve(int N) {
	srand(time(NULL));
 
	vector <int> num(2*N);
	for (int i = 0; i < 2*N; i++) num[i] = i+1;
	random_shuffle(All(num));
 
	vector <int> A, B;
	for (int id : num) {
		pre = now;
		now = Query(id);
		if (now != pre + 1) {
			B.pb(id);
		} else {
			A.pb(id);
		}
	}
	check(A, B, true, true);
}

Compilation message

minerals.cpp: In function 'void check(std::vector<int>, std::vector<int>, bool, bool)':
minerals.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for (int i = len; i < B.size(); i++) {
      |                    ~~^~~~~~~~~~
minerals.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (int i = 0; i < A.size(); i++) {
      |                  ~~^~~~~~~~~~
minerals.cpp:39:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |   if (LA.size() == len && !RA.size()) {
      |       ~~~~~~~~~~^~~~~~
minerals.cpp:40:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for (int j = len; j < A.size(); j++)
      |                      ~~^~~~~~~~~~
minerals.cpp:47:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |    for (int j = B.size()-len; j < A.size(); j++)
      |                               ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 5 ms 620 KB Output is correct
4 Correct 10 ms 876 KB Output is correct
5 Correct 20 ms 1644 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct
19 Correct 70 ms 3564 KB Output is correct
20 Correct 60 ms 3564 KB Output is correct
21 Correct 59 ms 3564 KB Output is correct
22 Correct 62 ms 3416 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct
19 Correct 70 ms 3564 KB Output is correct
20 Correct 60 ms 3564 KB Output is correct
21 Correct 59 ms 3564 KB Output is correct
22 Correct 62 ms 3416 KB Output is correct
23 Correct 66 ms 3692 KB Output is correct
24 Correct 68 ms 3712 KB Output is correct
25 Correct 61 ms 3692 KB Output is correct
26 Correct 71 ms 3564 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct
19 Correct 70 ms 3564 KB Output is correct
20 Correct 60 ms 3564 KB Output is correct
21 Correct 59 ms 3564 KB Output is correct
22 Correct 62 ms 3416 KB Output is correct
23 Correct 66 ms 3692 KB Output is correct
24 Correct 68 ms 3712 KB Output is correct
25 Correct 61 ms 3692 KB Output is correct
26 Correct 71 ms 3564 KB Output is correct
27 Correct 63 ms 3692 KB Output is correct
28 Correct 62 ms 3692 KB Output is correct
29 Correct 61 ms 3692 KB Output is correct
30 Correct 64 ms 3564 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct
19 Correct 70 ms 3564 KB Output is correct
20 Correct 60 ms 3564 KB Output is correct
21 Correct 59 ms 3564 KB Output is correct
22 Correct 62 ms 3416 KB Output is correct
23 Correct 66 ms 3692 KB Output is correct
24 Correct 68 ms 3712 KB Output is correct
25 Correct 61 ms 3692 KB Output is correct
26 Correct 71 ms 3564 KB Output is correct
27 Correct 63 ms 3692 KB Output is correct
28 Correct 62 ms 3692 KB Output is correct
29 Correct 61 ms 3692 KB Output is correct
30 Correct 64 ms 3564 KB Output is correct
31 Incorrect 69 ms 3820 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 876 KB Output is correct
9 Correct 20 ms 1644 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 20 ms 1516 KB Output is correct
13 Correct 20 ms 1516 KB Output is correct
14 Correct 20 ms 1516 KB Output is correct
15 Correct 58 ms 3564 KB Output is correct
16 Correct 58 ms 3436 KB Output is correct
17 Correct 58 ms 3564 KB Output is correct
18 Correct 56 ms 3308 KB Output is correct
19 Correct 70 ms 3564 KB Output is correct
20 Correct 60 ms 3564 KB Output is correct
21 Correct 59 ms 3564 KB Output is correct
22 Correct 62 ms 3416 KB Output is correct
23 Correct 66 ms 3692 KB Output is correct
24 Correct 68 ms 3712 KB Output is correct
25 Correct 61 ms 3692 KB Output is correct
26 Correct 71 ms 3564 KB Output is correct
27 Correct 63 ms 3692 KB Output is correct
28 Correct 62 ms 3692 KB Output is correct
29 Correct 61 ms 3692 KB Output is correct
30 Correct 64 ms 3564 KB Output is correct
31 Incorrect 69 ms 3820 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -