oj.uz

Submission #707782

# Submission time Handle Problem Language Result Execution time Memory
707782 2023-03-10T06:26:16 Z victor_gao Minerals (JOI19_minerals) C++17
40 / 100
 31 ms 2512 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];
int n;
void Merge(int l,int r,vector<int>have,bool stay1,bool stay2){
    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);
    for (int i=l-1;i<mid;i++)
        Query(arr[i]);
    Merge(l,mid,L,0,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
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:31:9: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |         if (ty)
      |         ^~

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 0 ms 336 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 1 ms 336 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 6 ms 628 KB Output is correct
5 Correct 14 ms 1104 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 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 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 1 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 628 KB Output is correct
9 Correct 14 ms 1104 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 908 KB Output is correct
12 Correct 12 ms 1172 KB Output is correct
13 Correct 10 ms 1168 KB Output is correct
14 Correct 10 ms 1052 KB Output is correct
15 Incorrect 31 ms 2512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -