oj.uz

답안 #1034455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034455 2024-07-25T13:57:56 Z Mr_Husanboy 드문 곤충 (IOI22_insects) C++17
25 / 100
 238 ms 600 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
const int mod = 1000002022;

vector<int> state, p;
int n, m; 
vector<vector<int>> g;
template<typename T>
int len(T &a){return a.size();}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

void shuffle(vector<int> &a, int n){
  if(n == 1) return;
  random_shuffle(a.begin(), a.begin() + n);
  for(int i = 0; i < n; i ++){
    int aa = rng() % n, bb = rng() % n;
    while(bb == aa) bb = rng() % n;
    swap(a[aa], a[bb]);
  }
}


int min_cardinality(int n) {
  int dis = 0;
  vector<int> v;
  vector<int> done(n);
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 2){
      move_outside(i);
      continue;
    }
    v.push_back(i);
  }
  dis = len(v);
  int lim = sqrt(n) + 1;
  if(dis <= lim){
    for(auto u : v){
      move_outside(u);
      done[u] = 1;
    }
    int ans = n;
    for(auto u : v){
      int cnt = 1;
      move_inside(u);
      for(int i = 0; i < n; i ++){
        if(done[i]) continue;
        move_inside(i);
        if(press_button() == 2){
          done[i] = 1;
          cnt ++;
        }
        move_outside(i);
      }
      move_outside(u);
      ans = min(ans, cnt);
    }
    return ans;
  }
  int ans = 1;
  while(true){
    for(auto u : v){
      move_outside(u);
      done[u] = 1;
    }

    v.clear();
    for(int i = 0; i < n;  i++){
      if(done[i]) continue;
      move_inside(i);
      if(press_button() == 2){
        move_outside(i); continue;
      }
      v.push_back(i);
    }
    if(len(v) != dis){
      break;
    }
    ans ++;
  } 

  return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 388 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 86 ms 344 KB Output is correct
26 Correct 83 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 73 ms 344 KB Output is correct
31 Correct 15 ms 344 KB Output is correct
32 Correct 26 ms 344 KB Output is correct
33 Correct 34 ms 344 KB Output is correct
34 Correct 43 ms 344 KB Output is correct
35 Correct 33 ms 344 KB Output is correct
36 Correct 74 ms 344 KB Output is correct
37 Correct 59 ms 344 KB Output is correct
38 Correct 14 ms 344 KB Output is correct
39 Correct 10 ms 344 KB Output is correct
40 Correct 5 ms 344 KB Output is correct
41 Correct 7 ms 344 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 11 ms 600 KB Output is correct
9 Incorrect 238 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -