oj.uz

Submission #628427

# Submission time Handle Problem Language Result Execution time Memory
628427 2022-08-13T11:52:26 Z c28dnv9q3 Rarest Insects (IOI22_insects) C++17
10 / 100
 334 ms 276 KB 
#include "insects.h"
#include <vector>
#include <numeric>
#include <map>
using namespace std;

vector<int> p;

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

int min_cardinality(int N) {
  p.resize(N);
  iota(p.begin(), p.end(), 0);
  for (int i = 0; i < N-1; i++) {
    move_inside(i);
    for (int j = i+1; j < N; j++) {
      if (ufind(i) == ufind(j))
        continue;
      move_inside(j);
      int k = press_button();
      if (k == 2)
        umerge(i, j);
      move_outside(j);
    }
    move_outside(i);
  }
  map<int,int> m;
  for (int i = 0; i < N; i++)
    m[ufind(i)]++;
  int ans = N;
  for (auto it = m.begin(); it != m.end(); it++)
    ans = min(ans, it->second);
  return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 208 KB Output is correct
6 Correct 210 ms 208 KB Output is correct
7 Correct 166 ms 264 KB Output is correct
8 Correct 105 ms 208 KB Output is correct
9 Correct 176 ms 208 KB Output is correct
10 Correct 204 ms 208 KB Output is correct
11 Correct 201 ms 272 KB Output is correct
12 Correct 148 ms 208 KB Output is correct
13 Correct 127 ms 208 KB Output is correct
14 Correct 160 ms 208 KB Output is correct
15 Correct 188 ms 208 KB Output is correct
16 Correct 176 ms 208 KB Output is correct
17 Correct 136 ms 208 KB Output is correct
18 Correct 114 ms 208 KB Output is correct
19 Correct 198 ms 208 KB Output is correct
20 Correct 80 ms 276 KB Output is correct
21 Correct 166 ms 268 KB Output is correct
22 Correct 155 ms 272 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 208 KB Output is correct
6 Correct 210 ms 208 KB Output is correct
7 Correct 166 ms 264 KB Output is correct
8 Correct 105 ms 208 KB Output is correct
9 Correct 176 ms 208 KB Output is correct
10 Correct 204 ms 208 KB Output is correct
11 Correct 201 ms 272 KB Output is correct
12 Correct 148 ms 208 KB Output is correct
13 Correct 127 ms 208 KB Output is correct
14 Correct 160 ms 208 KB Output is correct
15 Correct 188 ms 208 KB Output is correct
16 Correct 176 ms 208 KB Output is correct
17 Correct 136 ms 208 KB Output is correct
18 Correct 114 ms 208 KB Output is correct
19 Correct 198 ms 208 KB Output is correct
20 Correct 80 ms 276 KB Output is correct
21 Correct 166 ms 268 KB Output is correct
22 Correct 155 ms 272 KB Output is correct
23 Incorrect 334 ms 208 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Partially correct 0 ms 208 KB Output is partially correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Incorrect 182 ms 208 KB Too many queries.
8 Halted 0 ms 0 KB -