oj.uz

답안 #137960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137960 2019-07-28T15:31:59 Z Bohoty Minerals (JOI19_minerals) C++14
80 / 100
 382 ms 17180 KB 
#include "minerals.h"
//#include "grader.cpp"
#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;
const int mxN = 2e5 + 5;
int inside[mxN], tot;
int get(int x){
  if(inside[x])
  tot--;
  else
  tot++;
  inside[x] ^= 1;
  return tot - Query(x);
}
void goKill(set<int> a, set<int> b, bool aInside, bool bInside){
  // cout << a.size() << '\n';
  if(a.size() == 2){
      int cur = get(*a.begin());
      int cur2 = get(*b.begin());
      if(aInside){
        if(cur == cur2){
          Answer(*a.begin(),*b.begin());
          Answer(*a.rbegin(),*b.rbegin());
        } else {
          Answer(*a.begin(),*b.rbegin());
          Answer(*a.rbegin(),*b.begin());
        }
      }
    else {
      if(cur != cur2){
        Answer(*a.begin(),*b.begin());
        Answer(*a.rbegin(),*b.rbegin());
      } else {
        Answer(*a.begin(),*b.rbegin());
        Answer(*a.rbegin(),*b.begin());
      }
    }
    return;
  }
  if(a.size() == 1){
    Answer(*a.begin(), *b.begin());
    return;
  }
  std::vector<int> o;
  for(auto x : b)o.push_back(x);
  random_shuffle(o.begin(),o.end());
  int sz = a.size();
  set<int> x, y;
  int b4;
  int take = ceil(0.35 * sz);
  if(!aInside)take = sz - take;
  for(int j = 1; j <= take; j++){
    int v = *a.begin();
    a.erase(v);
    x.insert(v);
    b4 = get(v);
  }
  b.clear();
  for(auto it : o){
    if(x.size() == y.size())b.insert(it);
    else {
    int v = get(it);
    if((!aInside && v != b4)||(aInside && v == b4)){
      y.insert(it);
    } else b.insert(it);
    b4 = v;
    }
  }
  goKill(x,y,aInside^1,bInside^1);
  goKill(a,b,aInside,bInside^1);
}
void Solve(int N) {
  srand(time(0));
  int n = N + N;
  set<int> a, b;
  int b4 = 0;
  for (int i = 1; i <= n; i++) {
    int x = get(i);
    if(x > b4){
      a.insert(i);
    } else {
      b.insert(i);
    }
    b4 = x;
  }
  // cout << a.size() << ' ' << b.size() << '\n';

  goKill(a, b, 1, 1);

}

Compilation message

minerals.cpp: In function 'void goKill(std::set<int>, std::set<int>, bool, bool)':
minerals.cpp:64:29: warning: 'b4' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if((!aInside && v != b4)||(aInside && v == b4)){
        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 12 ms 1068 KB Output is correct
3 Correct 25 ms 1904 KB Output is correct
4 Correct 54 ms 3700 KB Output is correct
5 Correct 113 ms 6436 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct
19 Correct 348 ms 16484 KB Output is correct
20 Correct 349 ms 16404 KB Output is correct
21 Correct 336 ms 16532 KB Output is correct
22 Correct 331 ms 16320 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct
19 Correct 348 ms 16484 KB Output is correct
20 Correct 349 ms 16404 KB Output is correct
21 Correct 336 ms 16532 KB Output is correct
22 Correct 331 ms 16320 KB Output is correct
23 Correct 382 ms 17016 KB Output is correct
24 Correct 362 ms 16888 KB Output is correct
25 Correct 351 ms 16872 KB Output is correct
26 Correct 343 ms 16708 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct
19 Correct 348 ms 16484 KB Output is correct
20 Correct 349 ms 16404 KB Output is correct
21 Correct 336 ms 16532 KB Output is correct
22 Correct 331 ms 16320 KB Output is correct
23 Correct 382 ms 17016 KB Output is correct
24 Correct 362 ms 16888 KB Output is correct
25 Correct 351 ms 16872 KB Output is correct
26 Correct 343 ms 16708 KB Output is correct
27 Incorrect 338 ms 17180 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct
19 Correct 348 ms 16484 KB Output is correct
20 Correct 349 ms 16404 KB Output is correct
21 Correct 336 ms 16532 KB Output is correct
22 Correct 331 ms 16320 KB Output is correct
23 Correct 382 ms 17016 KB Output is correct
24 Correct 362 ms 16888 KB Output is correct
25 Correct 351 ms 16872 KB Output is correct
26 Correct 343 ms 16708 KB Output is correct
27 Incorrect 338 ms 17180 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 12 ms 1068 KB Output is correct
7 Correct 25 ms 1904 KB Output is correct
8 Correct 54 ms 3700 KB Output is correct
9 Correct 113 ms 6436 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 72 ms 4440 KB Output is correct
12 Correct 115 ms 6536 KB Output is correct
13 Correct 110 ms 6492 KB Output is correct
14 Correct 116 ms 6460 KB Output is correct
15 Correct 339 ms 16020 KB Output is correct
16 Correct 338 ms 16032 KB Output is correct
17 Correct 329 ms 16028 KB Output is correct
18 Correct 331 ms 15944 KB Output is correct
19 Correct 348 ms 16484 KB Output is correct
20 Correct 349 ms 16404 KB Output is correct
21 Correct 336 ms 16532 KB Output is correct
22 Correct 331 ms 16320 KB Output is correct
23 Correct 382 ms 17016 KB Output is correct
24 Correct 362 ms 16888 KB Output is correct
25 Correct 351 ms 16872 KB Output is correct
26 Correct 343 ms 16708 KB Output is correct
27 Incorrect 338 ms 17180 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -