oj.uz

Submission #705848

# Submission time Handle Problem Language Result Execution time Memory
705848 2023-03-05T13:34:19 Z qwerasdfzxcl Minerals (JOI19_minerals) C++17
40 / 100
 37 ms 3204 KB 
#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int n, cur, ans[100100];

void dnc0(vector<int> a);
void dnc1(vector<int> L, vector<int> R, bool on);

int myquery(int x){
    cur = Query(x);
    return cur;
}

void dnc0(vector<int> a){
    // printf("dnc0: ");
    // for (auto &x:a) printf("%d ", x);
    // printf("\n");
    int s0 = cur, c = a.size() / 2;

    if (c==0) return;
    if (c==1){
        ans[a[0]] = a[1];
        ans[a[1]] = a[0];
        return;
    }

    vector<int> L, R, Z;
    for (auto &x:a){
        int prv = cur;
        int now = myquery(x);
        if (now==prv){
            R.push_back(x);
        }
        else if (now <= s0 + c/2){
            L.push_back(x);
        }
        else{
            Z.push_back(x);
            myquery(x);
        }
    }

    dnc1(L, R, 1);
    dnc0(Z);
}

void dnc1(vector<int> L, vector<int> R, bool on){
    // printf("dnc1: ");
    // for (auto &x:L) printf("%d ", x);
    // printf("\n");
    // for (auto &x:R) printf("%d ", x);
    // printf("\n");
    
    int c = L.size();

    if (c==0) return;
    if (c==1){
        ans[L[0]] = R[0];
        ans[R[0]] = L[0];
        return;
    }

    vector<int> L1, R1, L2, R2;
    for (int i=0;i<c/2;i++) L1.push_back(L[i]);
    for (int i=c/2;i<c;i++) {L2.push_back(L[i]); myquery(L[i]);}

    for (auto &x:R){
        int prv = cur;
        if ((myquery(x)==prv) == on){
            myquery(x);
            R1.push_back(x);
        }
        else{
            R2.push_back(x);
        }
    }

    dnc1(L1, R1, on);
    dnc1(L2, R2, !on);
}

void Solve(int N) {
    n = N, cur = 0;
    vector<int> a;
    for (int i=1;i<=n*2;i++) a.push_back(i);
    
    dnc0(a);

    for (int i=1;i<=n*2;i++) if (i < ans[i]) Answer(i, ans[i]);
}

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 4 ms 592 KB Output is correct
4 Correct 7 ms 848 KB Output is correct
5 Correct 17 ms 1436 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 7 ms 848 KB Output is correct
9 Correct 17 ms 1436 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 15 ms 1400 KB Output is correct
13 Correct 12 ms 1476 KB Output is correct
14 Correct 12 ms 1360 KB Output is correct
15 Incorrect 37 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -