oj.uz

답안 #628441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628441 2022-08-13T12:01:39 Z c28dnv9q3 드문 곤충 (IOI22_insects) C++17
10 / 100
 256 ms 256 KB 
#include "insects.h"
#include <vector>
#include <numeric>
#include <map>
using namespace std;

vector<int> p;
vector<int> sz;

int ufind(int i) {
  if (p[i] == i) return i;
  return p[i] = ufind(p[i]);
}
int usz(int i) {
  return sz[ufind(i)];
}
void umerge(int a, int b) {
  if (ufind(a) == ufind(b))
    return;
  p[a] = b;
  sz[b] += sz[a];
}

int min_cardinality(int N) {
  p.resize(N);
  sz.resize(N);
  iota(p.begin(), p.end(), 0);
  fill(sz.begin(), sz.end(), 1);
  int minsz = N;

  for (int i = 0; i < N-1; i++) {
    //if (usz(i) >= minsz)
    //  continue;
    move_inside(i);
    for (int j = i+1; j < N; j++) {
      //if (usz(i) >= minsz || usz(j) >= minsz)
      //  continue;
      if (ufind(i) == ufind(j))
        continue;
      move_inside(j);
      if (press_button() == 2)
        umerge(j, i);
      move_outside(j);
    }
    move_outside(i);
    minsz = min(minsz, usz(i));
  }
  minsz = min(minsz, usz(N-1));
  return minsz;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 155 ms 208 KB Output is correct
8 Correct 202 ms 208 KB Output is correct
9 Correct 184 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 125 ms 208 KB Output is correct
12 Correct 179 ms 208 KB Output is correct
13 Correct 142 ms 208 KB Output is correct
14 Correct 97 ms 208 KB Output is correct
15 Correct 127 ms 208 KB Output is correct
16 Correct 187 ms 208 KB Output is correct
17 Correct 211 ms 208 KB Output is correct
18 Correct 81 ms 208 KB Output is correct
19 Correct 86 ms 256 KB Output is correct
20 Correct 199 ms 208 KB Output is correct
21 Correct 184 ms 208 KB Output is correct
22 Correct 207 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 155 ms 208 KB Output is correct
8 Correct 202 ms 208 KB Output is correct
9 Correct 184 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 125 ms 208 KB Output is correct
12 Correct 179 ms 208 KB Output is correct
13 Correct 142 ms 208 KB Output is correct
14 Correct 97 ms 208 KB Output is correct
15 Correct 127 ms 208 KB Output is correct
16 Correct 187 ms 208 KB Output is correct
17 Correct 211 ms 208 KB Output is correct
18 Correct 81 ms 208 KB Output is correct
19 Correct 86 ms 256 KB Output is correct
20 Correct 199 ms 208 KB Output is correct
21 Correct 184 ms 208 KB Output is correct
22 Correct 207 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Incorrect 253 ms 208 KB Too many queries.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 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 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 19 ms 208 KB Output is correct
8 Incorrect 256 ms 208 KB Too many queries.
9 Halted 0 ms 0 KB -