oj.uz

답안 #1034402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034402 2024-07-25T13:24:39 Z Mr_Husanboy 드문 곤충 (IOI22_insects) C++17
10 / 100
 247 ms 344 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) {
  vector<int> cnt(n);
  vector<int> type(n);
  vector<int> ind(n);
  int cur = 0;
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 1){
      type[cur] = i;
      ind[cur] = cur;
      cnt[cur] ++;
      cur ++;
      continue;
    }
    //cout << cur << endl;
    shuffle(ind, cur);
    int j = cur - 1;
    while(j > 0){
      move_outside(type[ind[j]]);
      if(press_button() == 1){
        move_inside(type[ind[j]]);
        break;
      }
      j --;
    }
    cnt[ind[j]] ++;
    while(j + 1 < cur){
      j ++;
      move_inside(type[ind[j]]);
    }
    //cout << i << ' ' << ind[j] << endl;
    move_outside(i);
  }
  int ans = n;
  for(int i = 0; i < cur; i ++){
    ans = min(ans, cnt[i]);
  }
  return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 10 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 29 ms 344 KB Output is correct
21 Correct 18 ms 344 KB Output is correct
22 Correct 16 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 94 ms 344 KB Output is correct
26 Correct 78 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Incorrect 247 ms 344 KB Too many queries.
29 Halted 0 ms 0 KB -

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 10 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Incorrect 218 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -