oj.uz

답안 #707809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707809 2023-03-10T08:05:16 Z victor_gao Minerals (JOI19_minerals) C++17
90 / 100
 47 ms 2844 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];
int n;
void Merge(int l,int r,vector<int>have,bool stay1){
    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){
        if (L.size()==(mid-l+1)){
            R.push_back(i);
            continue;
        }
        if (R.size()==(r-mid)){
            L.push_back(i);
            continue;
        }
        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);
    Merge(l,mid,L,1);
}
void Solve(int N){
    n=N;
    vector<int>qry;
    int last=-1;
    for (int i=1;i<=2*N;i++){
        if (arr.size()==N){
            qry.push_back(i);
            continue;
        }
        int now=Query(i);
        alive[i]^=1;
        if (now==last)
            qry.push_back(i);
        else {
            arr.push_back(i);
            last=now;
        }
    }
    shuffle(arr.begin(),arr.end(),rng);
    shuffle(qry.begin(),qry.end(),rng);
    Merge(1,N,qry,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)':
minerals.cpp:28:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |         if (L.size()==(mid-l+1)){
      |             ~~~~~~~~^~~~~~~~~~~
minerals.cpp:32:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |         if (R.size()==(r-mid)){
      |             ~~~~~~~~^~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:52:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |         if (arr.size()==N){
      |             ~~~~~~~~~~^~~
minerals.cpp: In function 'void Merge(int, int, std::vector<int>, bool)':
minerals.cpp:39:9: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   39 |         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 208 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 8 ms 724 KB Output is correct
5 Correct 16 ms 1124 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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 KB Output is correct
19 Correct 38 ms 2632 KB Output is correct
20 Correct 40 ms 2656 KB Output is correct
21 Correct 35 ms 2660 KB Output is correct
22 Correct 35 ms 2512 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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 KB Output is correct
19 Correct 38 ms 2632 KB Output is correct
20 Correct 40 ms 2656 KB Output is correct
21 Correct 35 ms 2660 KB Output is correct
22 Correct 35 ms 2512 KB Output is correct
23 Correct 45 ms 2796 KB Output is correct
24 Correct 44 ms 2840 KB Output is correct
25 Correct 36 ms 2684 KB Output is correct
26 Correct 36 ms 2560 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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 KB Output is correct
19 Correct 38 ms 2632 KB Output is correct
20 Correct 40 ms 2656 KB Output is correct
21 Correct 35 ms 2660 KB Output is correct
22 Correct 35 ms 2512 KB Output is correct
23 Correct 45 ms 2796 KB Output is correct
24 Correct 44 ms 2840 KB Output is correct
25 Correct 36 ms 2684 KB Output is correct
26 Correct 36 ms 2560 KB Output is correct
27 Correct 47 ms 2804 KB Output is correct
28 Correct 39 ms 2760 KB Output is correct
29 Correct 37 ms 2740 KB Output is correct
30 Correct 43 ms 2556 KB Output is correct

Subtask #8
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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 KB Output is correct
19 Correct 38 ms 2632 KB Output is correct
20 Correct 40 ms 2656 KB Output is correct
21 Correct 35 ms 2660 KB Output is correct
22 Correct 35 ms 2512 KB Output is correct
23 Correct 45 ms 2796 KB Output is correct
24 Correct 44 ms 2840 KB Output is correct
25 Correct 36 ms 2684 KB Output is correct
26 Correct 36 ms 2560 KB Output is correct
27 Correct 47 ms 2804 KB Output is correct
28 Correct 39 ms 2760 KB Output is correct
29 Correct 37 ms 2740 KB Output is correct
30 Correct 43 ms 2556 KB Output is correct
31 Correct 42 ms 2844 KB Output is correct
32 Correct 41 ms 2740 KB Output is correct
33 Correct 41 ms 2700 KB Output is correct
34 Correct 39 ms 2620 KB Output is correct

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 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 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 16 ms 1124 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 932 KB Output is correct
12 Correct 12 ms 1104 KB Output is correct
13 Correct 13 ms 1104 KB Output is correct
14 Correct 12 ms 1104 KB Output is correct
15 Correct 42 ms 2516 KB Output is correct
16 Correct 40 ms 2580 KB Output is correct
17 Correct 36 ms 2512 KB Output is correct
18 Correct 34 ms 2496 KB Output is correct
19 Correct 38 ms 2632 KB Output is correct
20 Correct 40 ms 2656 KB Output is correct
21 Correct 35 ms 2660 KB Output is correct
22 Correct 35 ms 2512 KB Output is correct
23 Correct 45 ms 2796 KB Output is correct
24 Correct 44 ms 2840 KB Output is correct
25 Correct 36 ms 2684 KB Output is correct
26 Correct 36 ms 2560 KB Output is correct
27 Correct 47 ms 2804 KB Output is correct
28 Correct 39 ms 2760 KB Output is correct
29 Correct 37 ms 2740 KB Output is correct
30 Correct 43 ms 2556 KB Output is correct
31 Correct 42 ms 2844 KB Output is correct
32 Correct 41 ms 2740 KB Output is correct
33 Correct 41 ms 2700 KB Output is correct
34 Correct 39 ms 2620 KB Output is correct
35 Incorrect 41 ms 2812 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -