oj.uz

Submission #376919

# Submission time Handle Problem Language Result Execution time Memory
376919 2021-03-12T07:08:57 Z casperwang Minerals (JOI19_minerals) C++14
90 / 100
 81 ms 4332 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 = (A.size() >= 3 ? B.size() * 19 / 50 : A.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 : RA) {
				pre = now;
				now = Query(j);
			}
			for (int j = i+1; 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 : LA) {
				pre = now;
				now = Query(j);
			}
			for (int j = i+1; 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:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for (int j = i+1; j < A.size(); j++)
      |                      ~~^~~~~~~~~~
minerals.cpp:55:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |    for (int j = i+1; 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 748 KB Output is correct
4 Correct 11 ms 1132 KB Output is correct
5 Correct 24 ms 1772 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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 KB Output is correct
19 Correct 64 ms 4076 KB Output is correct
20 Correct 67 ms 3948 KB Output is correct
21 Correct 71 ms 4076 KB Output is correct
22 Correct 68 ms 3820 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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 KB Output is correct
19 Correct 64 ms 4076 KB Output is correct
20 Correct 67 ms 3948 KB Output is correct
21 Correct 71 ms 4076 KB Output is correct
22 Correct 68 ms 3820 KB Output is correct
23 Correct 67 ms 4076 KB Output is correct
24 Correct 65 ms 4076 KB Output is correct
25 Correct 61 ms 4076 KB Output is correct
26 Correct 79 ms 3948 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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 KB Output is correct
19 Correct 64 ms 4076 KB Output is correct
20 Correct 67 ms 3948 KB Output is correct
21 Correct 71 ms 4076 KB Output is correct
22 Correct 68 ms 3820 KB Output is correct
23 Correct 67 ms 4076 KB Output is correct
24 Correct 65 ms 4076 KB Output is correct
25 Correct 61 ms 4076 KB Output is correct
26 Correct 79 ms 3948 KB Output is correct
27 Correct 68 ms 4084 KB Output is correct
28 Correct 69 ms 4076 KB Output is correct
29 Correct 65 ms 4112 KB Output is correct
30 Correct 81 ms 3948 KB Output is correct

Subtask #8
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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 KB Output is correct
19 Correct 64 ms 4076 KB Output is correct
20 Correct 67 ms 3948 KB Output is correct
21 Correct 71 ms 4076 KB Output is correct
22 Correct 68 ms 3820 KB Output is correct
23 Correct 67 ms 4076 KB Output is correct
24 Correct 65 ms 4076 KB Output is correct
25 Correct 61 ms 4076 KB Output is correct
26 Correct 79 ms 3948 KB Output is correct
27 Correct 68 ms 4084 KB Output is correct
28 Correct 69 ms 4076 KB Output is correct
29 Correct 65 ms 4112 KB Output is correct
30 Correct 81 ms 3948 KB Output is correct
31 Correct 73 ms 4204 KB Output is correct
32 Correct 70 ms 4140 KB Output is correct
33 Correct 70 ms 4196 KB Output is correct
34 Correct 72 ms 3972 KB Output is correct

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 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 24 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 16 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 21 ms 1772 KB Output is correct
14 Correct 24 ms 1772 KB Output is correct
15 Correct 61 ms 3920 KB Output is correct
16 Correct 79 ms 3916 KB Output is correct
17 Correct 59 ms 3948 KB Output is correct
18 Correct 58 ms 3704 KB Output is correct
19 Correct 64 ms 4076 KB Output is correct
20 Correct 67 ms 3948 KB Output is correct
21 Correct 71 ms 4076 KB Output is correct
22 Correct 68 ms 3820 KB Output is correct
23 Correct 67 ms 4076 KB Output is correct
24 Correct 65 ms 4076 KB Output is correct
25 Correct 61 ms 4076 KB Output is correct
26 Correct 79 ms 3948 KB Output is correct
27 Correct 68 ms 4084 KB Output is correct
28 Correct 69 ms 4076 KB Output is correct
29 Correct 65 ms 4112 KB Output is correct
30 Correct 81 ms 3948 KB Output is correct
31 Correct 73 ms 4204 KB Output is correct
32 Correct 70 ms 4140 KB Output is correct
33 Correct 70 ms 4196 KB Output is correct
34 Correct 72 ms 3972 KB Output is correct
35 Incorrect 67 ms 4332 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -