oj.uz

답안 #378195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378195 2021-03-16T07:19:27 Z casperwang Minerals (JOI19_minerals) C++14
85 / 100
 67 ms 4420 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 = 0; i < A.size(); i++) {
                pre = now;
                now = Query(A[i]);
								if (LA.size() == len) {
									RA.pb(A[i]);
								} else if (RA.size() == A.size() - len) {
									LA.pb(A[i]);
								} else 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]);
                }
        }
        for (int i = len; i < B.size(); i++) {
                RB.pb(B[i]);
        }
        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:27: 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 = 0; i < A.size(); i++) {
      |                         ~~^~~~~~~~~~
minerals.cpp:29:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |         if (LA.size() == len) {
      |             ~~~~~~~~~~^~~~~~
minerals.cpp:42:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int i = len; i < B.size(); i++) {
      |                           ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
4 Correct 11 ms 1132 KB Output is correct
5 Correct 19 ms 1772 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct
19 Correct 59 ms 4076 KB Output is correct
20 Correct 67 ms 4076 KB Output is correct
21 Correct 46 ms 4072 KB Output is correct
22 Correct 50 ms 3948 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct
19 Correct 59 ms 4076 KB Output is correct
20 Correct 67 ms 4076 KB Output is correct
21 Correct 46 ms 4072 KB Output is correct
22 Correct 50 ms 3948 KB Output is correct
23 Correct 56 ms 4076 KB Output is correct
24 Correct 55 ms 4076 KB Output is correct
25 Correct 52 ms 4072 KB Output is correct
26 Correct 54 ms 4048 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct
19 Correct 59 ms 4076 KB Output is correct
20 Correct 67 ms 4076 KB Output is correct
21 Correct 46 ms 4072 KB Output is correct
22 Correct 50 ms 3948 KB Output is correct
23 Correct 56 ms 4076 KB Output is correct
24 Correct 55 ms 4076 KB Output is correct
25 Correct 52 ms 4072 KB Output is correct
26 Correct 54 ms 4048 KB Output is correct
27 Correct 58 ms 4184 KB Output is correct
28 Correct 57 ms 4204 KB Output is correct
29 Correct 52 ms 4328 KB Output is correct
30 Correct 48 ms 4004 KB Output is correct

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct
19 Correct 59 ms 4076 KB Output is correct
20 Correct 67 ms 4076 KB Output is correct
21 Correct 46 ms 4072 KB Output is correct
22 Correct 50 ms 3948 KB Output is correct
23 Correct 56 ms 4076 KB Output is correct
24 Correct 55 ms 4076 KB Output is correct
25 Correct 52 ms 4072 KB Output is correct
26 Correct 54 ms 4048 KB Output is correct
27 Correct 58 ms 4184 KB Output is correct
28 Correct 57 ms 4204 KB Output is correct
29 Correct 52 ms 4328 KB Output is correct
30 Correct 48 ms 4004 KB Output is correct
31 Incorrect 67 ms 4420 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 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 5 ms 748 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 19 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 20 ms 1772 KB Output is correct
13 Correct 22 ms 1772 KB Output is correct
14 Correct 17 ms 1772 KB Output is correct
15 Correct 53 ms 4076 KB Output is correct
16 Correct 54 ms 3948 KB Output is correct
17 Correct 43 ms 3944 KB Output is correct
18 Correct 45 ms 3968 KB Output is correct
19 Correct 59 ms 4076 KB Output is correct
20 Correct 67 ms 4076 KB Output is correct
21 Correct 46 ms 4072 KB Output is correct
22 Correct 50 ms 3948 KB Output is correct
23 Correct 56 ms 4076 KB Output is correct
24 Correct 55 ms 4076 KB Output is correct
25 Correct 52 ms 4072 KB Output is correct
26 Correct 54 ms 4048 KB Output is correct
27 Correct 58 ms 4184 KB Output is correct
28 Correct 57 ms 4204 KB Output is correct
29 Correct 52 ms 4328 KB Output is correct
30 Correct 48 ms 4004 KB Output is correct
31 Incorrect 67 ms 4420 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -