oj.uz

Submission #915485

# Submission time Handle Problem Language Result Execution time Memory
915485 2024-01-24T03:38:37 Z guagua0407 Minerals (JOI19_minerals) C++17
100 / 100
 36 ms 3508 KB 
#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second

vector<int> a;
vector<int> belong;
vector<pair<int,int>> vec;
double p=0.37;

void go(int l,int r,vector<int> &b,int id){
    if(l==r){
        //Query(a[l]);
        assert((int)b.size()==1);
        vec.push_back({a[l],b[0]});
        return;
    }
    int mid=l+p*(r-l+1);
    int cur=0;
    for(int i=l;i<=mid;i++){
        cur=Query(a[i]);
    }
    vector<int> ls,rs;
    for(auto v:b){
        if(belong[v]<=mid){
            ls.push_back(v);
            continue;
        }
        if((int)ls.size()==mid-l+1){
            rs.push_back(v);
            continue;
        }
        if((int)rs.size()==r-mid){
            ls.push_back(v);
            continue;
        }
        int x=Query(v);
        if(id==0){
            if(x==cur){
                ls.push_back(v);
            }
            else{
                rs.push_back(v);
            }
        }
        else{
            if(x!=cur){
                ls.push_back(v);
            }
            else{
                rs.push_back(v);
            }
        }
        cur=x;
    }
    vector<int>().swap(b);
    if(id==0){
        go(l,mid,ls,1);
        go(mid+1,r,rs,0);
    }
    else{
        go(l,mid,ls,0);
        go(mid+1,r,rs,1);
    }
}

void Solve(int n){
    vector<bool> ok(2*n+1);
    int prv=0;
    vector<int> ord(2*n+1);
    for(int i=1;i<=2*n;i++){
        ord[i]=i;
    }
    mt19937 rng(time(NULL));
    shuffle(ord.begin()+1,ord.end(),rng);
    for(int t=1;t<=2*n;t++){
        int i=ord[t];
        int x=Query(i);
        if(x==prv+1){
            ok[i]=true;
        }
        prv=x;
    }
    vector<int> b;
    int cnt=-1;
    belong.resize(2*n+1);
    for(int t=1;t<=2*n;t++){
        int i=ord[t];
        if(ok[i]){
            a.push_back(i);
            cnt++;
        }
        else{
            b.push_back(i);
            belong[i]=cnt;
        }
    }
    go(0,n-1,b,1);
    for(auto v:vec){
        Answer(v.f,v.s);
    }
}

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Correct 9 ms 1368 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct
19 Correct 28 ms 3012 KB Output is correct
20 Correct 28 ms 3016 KB Output is correct
21 Correct 26 ms 3332 KB Output is correct
22 Correct 25 ms 3132 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct
19 Correct 28 ms 3012 KB Output is correct
20 Correct 28 ms 3016 KB Output is correct
21 Correct 26 ms 3332 KB Output is correct
22 Correct 25 ms 3132 KB Output is correct
23 Correct 36 ms 3136 KB Output is correct
24 Correct 28 ms 3152 KB Output is correct
25 Correct 26 ms 3056 KB Output is correct
26 Correct 26 ms 3256 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct
19 Correct 28 ms 3012 KB Output is correct
20 Correct 28 ms 3016 KB Output is correct
21 Correct 26 ms 3332 KB Output is correct
22 Correct 25 ms 3132 KB Output is correct
23 Correct 36 ms 3136 KB Output is correct
24 Correct 28 ms 3152 KB Output is correct
25 Correct 26 ms 3056 KB Output is correct
26 Correct 26 ms 3256 KB Output is correct
27 Correct 30 ms 3164 KB Output is correct
28 Correct 28 ms 3140 KB Output is correct
29 Correct 27 ms 3116 KB Output is correct
30 Correct 27 ms 3200 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct
19 Correct 28 ms 3012 KB Output is correct
20 Correct 28 ms 3016 KB Output is correct
21 Correct 26 ms 3332 KB Output is correct
22 Correct 25 ms 3132 KB Output is correct
23 Correct 36 ms 3136 KB Output is correct
24 Correct 28 ms 3152 KB Output is correct
25 Correct 26 ms 3056 KB Output is correct
26 Correct 26 ms 3256 KB Output is correct
27 Correct 30 ms 3164 KB Output is correct
28 Correct 28 ms 3140 KB Output is correct
29 Correct 27 ms 3116 KB Output is correct
30 Correct 27 ms 3200 KB Output is correct
31 Correct 28 ms 3296 KB Output is correct
32 Correct 29 ms 3160 KB Output is correct
33 Correct 27 ms 3408 KB Output is correct
34 Correct 27 ms 3332 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 9 ms 1368 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 9 ms 1560 KB Output is correct
15 Correct 28 ms 2996 KB Output is correct
16 Correct 25 ms 3132 KB Output is correct
17 Correct 26 ms 2996 KB Output is correct
18 Correct 25 ms 2880 KB Output is correct
19 Correct 28 ms 3012 KB Output is correct
20 Correct 28 ms 3016 KB Output is correct
21 Correct 26 ms 3332 KB Output is correct
22 Correct 25 ms 3132 KB Output is correct
23 Correct 36 ms 3136 KB Output is correct
24 Correct 28 ms 3152 KB Output is correct
25 Correct 26 ms 3056 KB Output is correct
26 Correct 26 ms 3256 KB Output is correct
27 Correct 30 ms 3164 KB Output is correct
28 Correct 28 ms 3140 KB Output is correct
29 Correct 27 ms 3116 KB Output is correct
30 Correct 27 ms 3200 KB Output is correct
31 Correct 28 ms 3296 KB Output is correct
32 Correct 29 ms 3160 KB Output is correct
33 Correct 27 ms 3408 KB Output is correct
34 Correct 27 ms 3332 KB Output is correct
35 Correct 31 ms 3168 KB Output is correct
36 Correct 29 ms 3268 KB Output is correct
37 Correct 28 ms 3508 KB Output is correct
38 Correct 32 ms 3264 KB Output is correct