oj.uz

Submission #915461

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

vector<int> a;
vector<pair<int,int>> vec;

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+r)/2;
    int cur=0;
    for(int i=mid+1;i<=r;i++){
        cur=Query(a[i]);
    }
    vector<int> ls,rs;
    for(auto v:b){
        int x=Query(v);
        if(id==0 or id==1){
            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,3);
    }
    else if(id==1){
        go(l,mid,ls,0);
        go(mid+1,r,rs,2);
    }
    else if(id==2){
        go(l,mid,ls,3);
        go(mid+1,r,rs,1);
    }
    else{
        go(l,mid,ls,2);
        go(mid+1,r,rs,0);
    }
}

void Solve(int n){
    vector<bool> ok(2*n+1);
    int prv=0;
    for(int i=1;i<=2*n;i++){
        int x=Query(i);
        if(x==prv+1){
            ok[i]=true;
        }
        prv=x;
    }
    vector<int> b;
    for(int i=1;i<=2*n;i++){
        if(ok[i]) a.push_back(i);
        else b.push_back(i);
    }
    go(0,n-1,b,3);
    for(auto v:vec){
        Answer(v.f,v.s);
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 7 ms 1112 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct
19 Incorrect 21 ms 2532 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct
19 Incorrect 21 ms 2532 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct
19 Incorrect 21 ms 2532 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct
19 Incorrect 21 ms 2532 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 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 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 8 ms 1336 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 20 ms 2376 KB Output is correct
16 Correct 20 ms 2368 KB Output is correct
17 Correct 14 ms 2420 KB Output is correct
18 Correct 18 ms 2920 KB Output is correct
19 Incorrect 21 ms 2532 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -