oj.uz

답안 #203350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203350 2020-02-20T09:53:49 Z theStaticMind Minerals (JOI19_minerals) C++14
85 / 100
 176 ms 6224 KB 
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define INF 1000000000//00000000
#define modulo 1000000007
#define mod 998244353
//#define int long long int
using namespace std;

#include "minerals.h"

int last = 0;
unordered_set<int> S;

void add(int x){
      if(S.count(x))S.erase(x);
      else S.insert(x);
}

void extract(vector<int>& A, vector<int>& B, vector<int>& X, vector<int>& Y){
      int n = sz(A), m = sz(B);
      int b = 0;
      for(int i = 0; i < m; i++) swap(B[rand() % m], B[rand() % m]);
      for(int i = 0; i < m; i++){
            int v;
            if(b == sz(A)) v = INF;
            else v = Query(B[i]), add(B[i]);
            if(v == last){
                  X.pb(B[i]);
                  b++;
            }
            else Y.pb(B[i]);
            if(v != INF)
            last = v;
      }
}

void divide(vector<int>& A, vector<int>& B){
      int n = A.size();
      if(n == 1){
            Answer(A[0], B[0]);
            return;
      }
      vector<int> X, Y;
      vector<int> tempA, tempB;
      for(int i = 0; i < n / 2; i++)tempA.pb(A[i]);
      for(int i = n / 2; i < n; i++)tempB.pb(A[i]);
      if(!(S.count(tempA[0]) ^ S.count(tempB[0]))){
            if(tempB.size() > tempA.size()) swap(tempA, tempB);
            for(int i = 0; i < tempB.size(); i++) last = Query(tempB[i]), add(tempB[i]);
      }
      if(S.count(tempB[0])){
            swap(tempA, tempB);
      }
      extract(tempA, B, X, Y);
      divide(tempA, X);
      divide(tempB, Y);
}

void Solve(int N) {
      vector<int> A, B;
      vector<int> arr;
      for(int i = 1; i <= 2 * N; i++)arr.pb(i);
      srand(time(NULL));
      for(int i = 0; i < 2 * N; i++) swap(arr[rand() % sz(arr)], arr[rand() % sz(arr)]);
      for(auto i : arr){
            int q;
            if(last == N) q = last;
            else q = Query(i);
            S.insert(i);
            if(last == q){
                  B.pb(i);
            }
            else{
                  A.pb(i);
            }
            last = q;
      }
      divide(A, B);
}

Compilation message

minerals.cpp: In function 'void extract(std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
minerals.cpp:23:11: warning: unused variable 'n' [-Wunused-variable]
       int n = sz(A), m = sz(B);
           ^
minerals.cpp: In function 'void divide(std::vector<int>&, std::vector<int>&)':
minerals.cpp:52:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < tempB.size(); i++) last = Query(tempB[i]), add(tempB[i]);
                            ~~^~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 10 ms 632 KB Output is correct
3 Correct 16 ms 1016 KB Output is correct
4 Correct 29 ms 1400 KB Output is correct
5 Correct 55 ms 2472 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct
19 Correct 154 ms 5968 KB Output is correct
20 Correct 168 ms 5968 KB Output is correct
21 Correct 162 ms 6096 KB Output is correct
22 Correct 155 ms 5840 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct
19 Correct 154 ms 5968 KB Output is correct
20 Correct 168 ms 5968 KB Output is correct
21 Correct 162 ms 6096 KB Output is correct
22 Correct 155 ms 5840 KB Output is correct
23 Correct 155 ms 6092 KB Output is correct
24 Correct 162 ms 6092 KB Output is correct
25 Correct 153 ms 6224 KB Output is correct
26 Correct 152 ms 5964 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct
19 Correct 154 ms 5968 KB Output is correct
20 Correct 168 ms 5968 KB Output is correct
21 Correct 162 ms 6096 KB Output is correct
22 Correct 155 ms 5840 KB Output is correct
23 Correct 155 ms 6092 KB Output is correct
24 Correct 162 ms 6092 KB Output is correct
25 Correct 153 ms 6224 KB Output is correct
26 Correct 152 ms 5964 KB Output is correct
27 Correct 164 ms 6220 KB Output is correct
28 Correct 172 ms 6096 KB Output is correct
29 Correct 157 ms 6096 KB Output is correct
30 Correct 159 ms 5968 KB Output is correct

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct
19 Correct 154 ms 5968 KB Output is correct
20 Correct 168 ms 5968 KB Output is correct
21 Correct 162 ms 6096 KB Output is correct
22 Correct 155 ms 5840 KB Output is correct
23 Correct 155 ms 6092 KB Output is correct
24 Correct 162 ms 6092 KB Output is correct
25 Correct 153 ms 6224 KB Output is correct
26 Correct 152 ms 5964 KB Output is correct
27 Correct 164 ms 6220 KB Output is correct
28 Correct 172 ms 6096 KB Output is correct
29 Correct 157 ms 6096 KB Output is correct
30 Correct 159 ms 5968 KB Output is correct
31 Incorrect 176 ms 6224 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 29 ms 1400 KB Output is correct
9 Correct 55 ms 2472 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 53 ms 2600 KB Output is correct
13 Correct 55 ms 2600 KB Output is correct
14 Correct 54 ms 2600 KB Output is correct
15 Correct 152 ms 5836 KB Output is correct
16 Correct 155 ms 5768 KB Output is correct
17 Correct 145 ms 5840 KB Output is correct
18 Correct 149 ms 5712 KB Output is correct
19 Correct 154 ms 5968 KB Output is correct
20 Correct 168 ms 5968 KB Output is correct
21 Correct 162 ms 6096 KB Output is correct
22 Correct 155 ms 5840 KB Output is correct
23 Correct 155 ms 6092 KB Output is correct
24 Correct 162 ms 6092 KB Output is correct
25 Correct 153 ms 6224 KB Output is correct
26 Correct 152 ms 5964 KB Output is correct
27 Correct 164 ms 6220 KB Output is correct
28 Correct 172 ms 6096 KB Output is correct
29 Correct 157 ms 6096 KB Output is correct
30 Correct 159 ms 5968 KB Output is correct
31 Incorrect 176 ms 6224 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -