oj.uz

답안 #707797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707797 2023-03-10T07:11:38 Z victor_gao Minerals (JOI19_minerals) C++17
85 / 100
 41 ms 2892 KB 
#include"minerals.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int>arr;
bool alive[100015],vis[100015];
const int C=19;
int n;
void brute(vector<int>arr1,vector<int>arr2,bool stay){
    stay^=1;
    shuffle(arr1.begin(),arr1.end(),rng);
    shuffle(arr2.begin(),arr2.end(),rng);
   // cout<<"Brute : \n";
   // for (auto i:arr1) cout<<i<<" ";
   // cout<<'\n';
   // for (auto i:arr2) cout<<i<<' ';
   // cout<<'\n';
    int sz=arr1.size();
    for (auto i:arr2){
        int last=Query(i),use=0;
        shuffle(arr1.begin(),arr1.end(),rng);
        for (auto j:arr1){
            if (vis[j]) continue;
            if (use==sz-1){
                Answer(i,j);
                break;
            }
            alive[j]^=1;
            int now=Query(j);
            if (stay==1){
                if (now==last){
                 //   cout<<"match1 "<<i<<" "<<j<<'\n';
                    Answer(i,j);
                    vis[j]=1;
                    break;
                }
            }
            else {
                if (now!=last){
                 //   cout<<"match2 "<<i<<" "<<j<<'\n';
                    Answer(i,j);
                    vis[j]=1;
                    break;
                }
            }
            last=now;
        }
        sz--;
    }
}
void Merge(int l,int r,vector<int>have,bool stay1,bool stay2){
    if (r-l+1<=C){
        vector<int>now;
        for (int i=l-1;i<r;i++)
            now.push_back(arr[i]);
        brute(now,have,stay2);
        return;
    }
   /*
    if (l==r){
        Answer(arr[l-1],have[0]);
        return;
    }
    */
    int mid=(l+r)>>1,last;
    vector<int>L,R;
    if (!stay1){
        for (int i=l-1;i<mid;i++){
            last=Query(arr[i]);
            alive[arr[i]]^=1;
        }
    }
    else {
        for (int i=mid;i<r;i++){
            last=Query(arr[i]);
            alive[arr[i]]^=1;
        }
    }
    for (auto i:have){
        int now=Query(i);
        alive[i]^=1;
        bool ty=(now==last);
        if (ty)
            L.push_back(i);
        else R.push_back(i);
        last=now;
    }
    Merge(mid+1,r,R,0,stay2^1);
    Merge(l,mid,L,1,stay2^1);
}
void Solve(int N){
    n=N;
    vector<int>qry;
    int last=-1;
    for (int i=1;i<=2*N;i++){
        int now=Query(i);
        if (now==last){
            qry.push_back(i);
        }
        else {
            arr.push_back(i);
            last=now;
        }
        alive[i]=1;
    }
    //for (auto i:arr) cout<<i<<" ";
    //cout<<'\n';
    //for (auto i:qry) cout<<i<<" ";
    //cout<<'\n';
    Merge(1,N,qry,1,1);
}
/*
g++ -std=gnu++14 -O2 -o grader grader.cpp minerals.cpp
./grader.exe
./rand.exe

4
1 5
2 6
3 4
7 8
*/

Compilation message

minerals.cpp: In function 'void Merge(int, int, std::vector<int>, bool, bool)':
minerals.cpp:83:9: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |         if (ty)
      |         ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 7 ms 720 KB Output is correct
5 Correct 13 ms 1104 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct
19 Correct 38 ms 2672 KB Output is correct
20 Correct 37 ms 2648 KB Output is correct
21 Correct 33 ms 2584 KB Output is correct
22 Correct 33 ms 2456 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct
19 Correct 38 ms 2672 KB Output is correct
20 Correct 37 ms 2648 KB Output is correct
21 Correct 33 ms 2584 KB Output is correct
22 Correct 33 ms 2456 KB Output is correct
23 Correct 39 ms 2888 KB Output is correct
24 Correct 39 ms 2728 KB Output is correct
25 Correct 32 ms 2620 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct
19 Correct 38 ms 2672 KB Output is correct
20 Correct 37 ms 2648 KB Output is correct
21 Correct 33 ms 2584 KB Output is correct
22 Correct 33 ms 2456 KB Output is correct
23 Correct 39 ms 2888 KB Output is correct
24 Correct 39 ms 2728 KB Output is correct
25 Correct 32 ms 2620 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 40 ms 2776 KB Output is correct
28 Correct 41 ms 2872 KB Output is correct
29 Correct 33 ms 2656 KB Output is correct
30 Correct 35 ms 2504 KB Output is correct

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct
19 Correct 38 ms 2672 KB Output is correct
20 Correct 37 ms 2648 KB Output is correct
21 Correct 33 ms 2584 KB Output is correct
22 Correct 33 ms 2456 KB Output is correct
23 Correct 39 ms 2888 KB Output is correct
24 Correct 39 ms 2728 KB Output is correct
25 Correct 32 ms 2620 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 40 ms 2776 KB Output is correct
28 Correct 41 ms 2872 KB Output is correct
29 Correct 33 ms 2656 KB Output is correct
30 Correct 35 ms 2504 KB Output is correct
31 Incorrect 38 ms 2892 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 7 ms 720 KB Output is correct
9 Correct 13 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 848 KB Output is correct
12 Correct 13 ms 1104 KB Output is correct
13 Correct 14 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 38 ms 2612 KB Output is correct
16 Correct 37 ms 2540 KB Output is correct
17 Correct 32 ms 2464 KB Output is correct
18 Correct 33 ms 2400 KB Output is correct
19 Correct 38 ms 2672 KB Output is correct
20 Correct 37 ms 2648 KB Output is correct
21 Correct 33 ms 2584 KB Output is correct
22 Correct 33 ms 2456 KB Output is correct
23 Correct 39 ms 2888 KB Output is correct
24 Correct 39 ms 2728 KB Output is correct
25 Correct 32 ms 2620 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 40 ms 2776 KB Output is correct
28 Correct 41 ms 2872 KB Output is correct
29 Correct 33 ms 2656 KB Output is correct
30 Correct 35 ms 2504 KB Output is correct
31 Incorrect 38 ms 2892 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -