oj.uz

답안 #378190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378190 2021-03-16T07:13:07 Z casperwang Minerals (JOI19_minerals) C++14
90 / 100
 88 ms 4484 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]; }

const double e = exp(1); 
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 = max<int>(1, B.size() / e);
	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() <= (A.size() - len) / 2) {
			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() <= len / 2) {
			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:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for (int i = len; i < B.size(); i++) {
      |                    ~~^~~~~~~~~~
minerals.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i = 0; i < A.size(); i++) {
      |                  ~~^~~~~~~~~~
minerals.cpp:40:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |   if (LA.size() == len && RA.size() <= (A.size() - len) / 2) {
      |       ~~~~~~~~~~^~~~~~
minerals.cpp:45:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |    for (int j = i+1; j < A.size(); j++)
      |                      ~~^~~~~~~~~~
minerals.cpp:51:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   if (RA.size() == B.size()-len && LA.size() <= len / 2) {
      |                                    ~~~~~~~~~~^~~~~~~~~~
minerals.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |    for (int j = i+1; j < A.size(); j++)
      |                      ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 8 ms 748 KB Output is correct
4 Correct 11 ms 1132 KB Output is correct
5 Correct 25 ms 1772 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct
19 Correct 62 ms 3948 KB Output is correct
20 Correct 76 ms 4076 KB Output is correct
21 Correct 63 ms 4080 KB Output is correct
22 Correct 66 ms 3820 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct
19 Correct 62 ms 3948 KB Output is correct
20 Correct 76 ms 4076 KB Output is correct
21 Correct 63 ms 4080 KB Output is correct
22 Correct 66 ms 3820 KB Output is correct
23 Correct 72 ms 4140 KB Output is correct
24 Correct 66 ms 4204 KB Output is correct
25 Correct 65 ms 4076 KB Output is correct
26 Correct 67 ms 3948 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct
19 Correct 62 ms 3948 KB Output is correct
20 Correct 76 ms 4076 KB Output is correct
21 Correct 63 ms 4080 KB Output is correct
22 Correct 66 ms 3820 KB Output is correct
23 Correct 72 ms 4140 KB Output is correct
24 Correct 66 ms 4204 KB Output is correct
25 Correct 65 ms 4076 KB Output is correct
26 Correct 67 ms 3948 KB Output is correct
27 Correct 70 ms 4156 KB Output is correct
28 Correct 68 ms 4156 KB Output is correct
29 Correct 68 ms 4304 KB Output is correct
30 Correct 68 ms 4076 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct
19 Correct 62 ms 3948 KB Output is correct
20 Correct 76 ms 4076 KB Output is correct
21 Correct 63 ms 4080 KB Output is correct
22 Correct 66 ms 3820 KB Output is correct
23 Correct 72 ms 4140 KB Output is correct
24 Correct 66 ms 4204 KB Output is correct
25 Correct 65 ms 4076 KB Output is correct
26 Correct 67 ms 3948 KB Output is correct
27 Correct 70 ms 4156 KB Output is correct
28 Correct 68 ms 4156 KB Output is correct
29 Correct 68 ms 4304 KB Output is correct
30 Correct 68 ms 4076 KB Output is correct
31 Correct 75 ms 4332 KB Output is correct
32 Correct 73 ms 4332 KB Output is correct
33 Correct 70 ms 4332 KB Output is correct
34 Correct 88 ms 4460 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 25 ms 1772 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 14 ms 1260 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 21 ms 1772 KB Output is correct
15 Correct 60 ms 4076 KB Output is correct
16 Correct 62 ms 4076 KB Output is correct
17 Correct 61 ms 3948 KB Output is correct
18 Correct 58 ms 3820 KB Output is correct
19 Correct 62 ms 3948 KB Output is correct
20 Correct 76 ms 4076 KB Output is correct
21 Correct 63 ms 4080 KB Output is correct
22 Correct 66 ms 3820 KB Output is correct
23 Correct 72 ms 4140 KB Output is correct
24 Correct 66 ms 4204 KB Output is correct
25 Correct 65 ms 4076 KB Output is correct
26 Correct 67 ms 3948 KB Output is correct
27 Correct 70 ms 4156 KB Output is correct
28 Correct 68 ms 4156 KB Output is correct
29 Correct 68 ms 4304 KB Output is correct
30 Correct 68 ms 4076 KB Output is correct
31 Correct 75 ms 4332 KB Output is correct
32 Correct 73 ms 4332 KB Output is correct
33 Correct 70 ms 4332 KB Output is correct
34 Correct 88 ms 4460 KB Output is correct
35 Incorrect 80 ms 4484 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -