oj.uz

답안 #378160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378160 2021-03-16T05:44:11 Z 2qbingxuan Minerals (JOI19_minerals) C++14
40 / 100
 36 ms 2668 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
 
void dq(vector<int> A, vector<int> B) {
    assert(A.size() == B.size());
    if (A.empty()) return;
    if (A.size() == 1) {
        // cerr << "cand.size() = " << cand.size() << endl;
        Answer(A[0], B[0]);
        return;
    }
    int m = A.size() / 2;
    int cur = -1;
    for (int i = 0; i < m; i++)
        cur = Query(A[i]);
    vector<int> L, R;
    for (int x: B) {
        if (Query(x) == cur) {
            L.push_back(x);
        } else {
            R.push_back(x);
        }
        Query(x);
    }
    for (int i = 0; i < m; i++)
        Query(A[i]);
    dq(vector<int>(A.begin(), A.begin() + m), L);
    dq(vector<int>(A.begin() + m, A.end()), R);
}
int f(int n) {
    int dep = __lg(n) + 1;
    return n * 6 * dep;
}
void Solve(int N) {
    vector<int> A, B;
    int cur = 0;
    for (int i = 1; i <= N*2; i++) {
        int q = Query(i);
        if (q == cur) {
            Query(i);
            A.push_back(i);
        } else {
            B.push_back(i);
        }
        cur = q;
    }
    dq(A, B);
    cerr << f(N) << '\n';
    // for (int i = 1; i <= 50; i++) cerr << i << ' ' << f(i) << endl;
    /*
    for (int i = 1; i <= N*2; i++) {
        Query(i);
        for (int j = 1; j < i; j++) {
            if (Query(j) == 1)
                Answer(i, j);
            Query(j);
        }
        Query(i);
    }
    */
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 5 ms 620 KB Output is correct
4 Correct 9 ms 748 KB Output is correct
5 Correct 19 ms 1260 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 19 ms 1260 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 16 ms 1260 KB Output is correct
13 Correct 14 ms 1260 KB Output is correct
14 Correct 14 ms 1260 KB Output is correct
15 Incorrect 36 ms 2668 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -