oj.uz

답안 #678471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678471 2023-01-06T04:30:27 Z cig32 드문 곤충 (IOI22_insects) C++17
100 / 100
 70 ms 484 KB 
#include "insects.h"
#include "bits/stdc++.h"
using namespace std;
 
set<int> machine;
 
int pvans; // Answer doesn't change if machine doesn't change
 
 
int inc = 0, outc = 0, qc = 0;
void move_in(int i) {
  if(machine.count(i)) return;
  machine.insert(i);
  move_inside(i);
  inc++;
  pvans = -1;
}
 
void move_out(int i) {
  if(machine.count(i)) {
    machine.erase(i);
    move_outside(i);
    outc++;
    pvans = -1;
  }
}
 
 
int query() {
  if(pvans == -1) {
    qc++;
    return pvans = press_button();
  }
  return pvans;
}
 
 
bool in_machine(int i) {
  return machine.count(i);
}
mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
 
int rnd(int x, int y) {
  return uniform_int_distribution<int>(x, y)(rng);
}
 
int min_cardinality(int N) {
  inc = 0, outc = 0, qc = 0;
  machine.clear();
  int T = 0;
  pvans = -1;
 
 
  for(int i=0; i<N; i++) {
    move_in(i);
    int pb = query();
    if(pb == 1) {
      T++;
    }
    else {
      move_out(i);
    }
  }
 
 /*
  for(int i=0; i<N; i++) {
    move_out(i);
  }
 */
  if(T == 1) return N;
  int lb = 1, rb = N/T;
  vector<int> relevant;
  for(int i=0; i<N; i++) relevant.push_back(i);
  int sub = 0;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    
    int good = 0;
    int m = relevant.size();
 
    shuffle(relevant.begin(), relevant.end(), rng);
 
    
    set<int> gv, bv;
    for(int x: relevant) {
      
      int qans;
      if(mid == sub || good == T * (mid - sub)) qans = 100000;
      else {
        move_in(x);
        qans = query();
      }
      if(qans > mid - sub) {
        move_out(x);
        bv.insert(x);
      }
      else {
        good++;
        gv.insert(x);
      }
    }
    if(good == T * (mid - sub)) {
      lb = mid;
      sub = mid;
      relevant.clear();
      for(int x: bv) relevant.push_back(x);
    }
    else {
      rb = mid - 1;
      relevant.clear();
      for(int x: gv) relevant.push_back(x);
    }
    if(lb < rb) {
      for(int i=0; i<N; i++) {
        move_out(i);
      }
    }
  }
  return lb;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:79:9: warning: unused variable 'm' [-Wunused-variable]
   79 |     int m = relevant.size();
      |         ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 268 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 308 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 3 ms 312 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 5 ms 308 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 312 KB Output is correct
17 Correct 7 ms 304 KB Output is correct
18 Correct 5 ms 308 KB Output is correct
19 Correct 6 ms 304 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 296 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 268 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 308 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 3 ms 312 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 5 ms 308 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 312 KB Output is correct
17 Correct 7 ms 304 KB Output is correct
18 Correct 5 ms 308 KB Output is correct
19 Correct 6 ms 304 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 296 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 8 ms 324 KB Output is correct
25 Correct 19 ms 328 KB Output is correct
26 Correct 27 ms 344 KB Output is correct
27 Correct 17 ms 320 KB Output is correct
28 Correct 8 ms 328 KB Output is correct
29 Correct 30 ms 348 KB Output is correct
30 Correct 14 ms 328 KB Output is correct
31 Correct 25 ms 340 KB Output is correct
32 Correct 38 ms 324 KB Output is correct
33 Correct 27 ms 284 KB Output is correct
34 Correct 21 ms 344 KB Output is correct
35 Correct 27 ms 296 KB Output is correct
36 Correct 22 ms 344 KB Output is correct
37 Correct 30 ms 352 KB Output is correct
38 Correct 24 ms 316 KB Output is correct
39 Correct 20 ms 292 KB Output is correct
40 Correct 11 ms 344 KB Output is correct
41 Correct 10 ms 208 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 14 ms 208 KB Output is correct
8 Correct 18 ms 364 KB Output is correct
9 Correct 53 ms 436 KB Output is correct
10 Correct 59 ms 412 KB Output is correct
11 Correct 50 ms 296 KB Output is correct
12 Correct 28 ms 352 KB Output is correct
13 Correct 60 ms 292 KB Output is correct
14 Correct 49 ms 480 KB Output is correct
15 Correct 55 ms 408 KB Output is correct
16 Correct 58 ms 412 KB Output is correct
17 Correct 42 ms 432 KB Output is correct
18 Correct 55 ms 408 KB Output is correct
19 Correct 44 ms 420 KB Output is correct
20 Correct 33 ms 412 KB Output is correct
21 Correct 44 ms 428 KB Output is correct
22 Correct 44 ms 428 KB Output is correct
23 Correct 45 ms 424 KB Output is correct
24 Correct 39 ms 432 KB Output is correct
25 Correct 24 ms 432 KB Output is correct
26 Correct 19 ms 320 KB Output is correct
27 Correct 41 ms 428 KB Output is correct
28 Correct 36 ms 416 KB Output is correct
29 Correct 38 ms 332 KB Output is correct
30 Correct 56 ms 428 KB Output is correct
31 Correct 70 ms 424 KB Output is correct
32 Correct 44 ms 420 KB Output is correct
33 Correct 49 ms 392 KB Output is correct
34 Correct 52 ms 416 KB Output is correct
35 Correct 48 ms 416 KB Output is correct
36 Correct 42 ms 432 KB Output is correct
37 Correct 33 ms 428 KB Output is correct
38 Correct 57 ms 428 KB Output is correct
39 Correct 31 ms 416 KB Output is correct
40 Correct 49 ms 456 KB Output is correct
41 Correct 50 ms 424 KB Output is correct
42 Correct 52 ms 424 KB Output is correct
43 Correct 10 ms 324 KB Output is correct
44 Correct 38 ms 340 KB Output is correct
45 Correct 35 ms 484 KB Output is correct
46 Correct 27 ms 424 KB Output is correct
47 Correct 37 ms 340 KB Output is correct
48 Correct 32 ms 416 KB Output is correct