oj.uz

답안 #203348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203348 2020-02-20T09:29:39 Z theStaticMind Minerals (JOI19_minerals) C++14
85 / 100
 504 ms 6896 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;
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 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 16 ms 560 KB Output is correct
3 Correct 30 ms 888 KB Output is correct
4 Correct 66 ms 1532 KB Output is correct
5 Correct 139 ms 2556 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct
19 Correct 452 ms 6336 KB Output is correct
20 Correct 442 ms 6256 KB Output is correct
21 Correct 446 ms 6384 KB Output is correct
22 Correct 443 ms 6128 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct
19 Correct 452 ms 6336 KB Output is correct
20 Correct 442 ms 6256 KB Output is correct
21 Correct 446 ms 6384 KB Output is correct
22 Correct 443 ms 6128 KB Output is correct
23 Correct 460 ms 6436 KB Output is correct
24 Correct 464 ms 6640 KB Output is correct
25 Correct 457 ms 6512 KB Output is correct
26 Correct 449 ms 6256 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct
19 Correct 452 ms 6336 KB Output is correct
20 Correct 442 ms 6256 KB Output is correct
21 Correct 446 ms 6384 KB Output is correct
22 Correct 443 ms 6128 KB Output is correct
23 Correct 460 ms 6436 KB Output is correct
24 Correct 464 ms 6640 KB Output is correct
25 Correct 457 ms 6512 KB Output is correct
26 Correct 449 ms 6256 KB Output is correct
27 Correct 495 ms 6640 KB Output is correct
28 Correct 504 ms 6768 KB Output is correct
29 Correct 461 ms 6640 KB Output is correct
30 Correct 471 ms 6640 KB Output is correct

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct
19 Correct 452 ms 6336 KB Output is correct
20 Correct 442 ms 6256 KB Output is correct
21 Correct 446 ms 6384 KB Output is correct
22 Correct 443 ms 6128 KB Output is correct
23 Correct 460 ms 6436 KB Output is correct
24 Correct 464 ms 6640 KB Output is correct
25 Correct 457 ms 6512 KB Output is correct
26 Correct 449 ms 6256 KB Output is correct
27 Correct 495 ms 6640 KB Output is correct
28 Correct 504 ms 6768 KB Output is correct
29 Correct 461 ms 6640 KB Output is correct
30 Correct 471 ms 6640 KB Output is correct
31 Incorrect 469 ms 6896 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 16 ms 560 KB Output is correct
7 Correct 30 ms 888 KB Output is correct
8 Correct 66 ms 1532 KB Output is correct
9 Correct 139 ms 2556 KB Output is correct
10 Correct 10 ms 508 KB Output is correct
11 Correct 86 ms 1904 KB Output is correct
12 Correct 141 ms 2552 KB Output is correct
13 Correct 139 ms 2552 KB Output is correct
14 Correct 136 ms 2552 KB Output is correct
15 Correct 430 ms 6180 KB Output is correct
16 Correct 430 ms 6216 KB Output is correct
17 Correct 437 ms 6128 KB Output is correct
18 Correct 422 ms 6132 KB Output is correct
19 Correct 452 ms 6336 KB Output is correct
20 Correct 442 ms 6256 KB Output is correct
21 Correct 446 ms 6384 KB Output is correct
22 Correct 443 ms 6128 KB Output is correct
23 Correct 460 ms 6436 KB Output is correct
24 Correct 464 ms 6640 KB Output is correct
25 Correct 457 ms 6512 KB Output is correct
26 Correct 449 ms 6256 KB Output is correct
27 Correct 495 ms 6640 KB Output is correct
28 Correct 504 ms 6768 KB Output is correct
29 Correct 461 ms 6640 KB Output is correct
30 Correct 471 ms 6640 KB Output is correct
31 Incorrect 469 ms 6896 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -