oj.uz

Submission #1057810

# Submission time Handle Problem Language Result Execution time Memory
1057810 2024-08-14T06:21:41 Z MercubytheFirst Rarest Insects (IOI22_insects) C++17
10 / 100
 170 ms 436 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


int min_cardinality(int N) {
  vector<int> type(N, -1);
  for(int i = 0; i < N; ++i) {
    if(type[i] == -1) {
      type[i] = i;
    }
    else {
      continue;
    }
    move_inside(i);
    for(int j = i + 1; j < N; ++j) {
      if(type[j] != -1) {
        continue;
      }
      move_inside(j);
      const int c = press_button();
      if(c == 2) {
        type[j] = type[i];
      }
      move_outside(j);
    }
    move_outside(i);
  }
  vector<int> cnt(N);
  for(int x : type) {
    assert(x != -1);
    cnt[x]++;
  }
  int mn = N + 32;
  for(int x : cnt) {
    if(x > 0) {
      mn = min(mn, x);
    }
  }
  return mn;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 92 ms 344 KB Output is correct
8 Correct 8 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 20 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 16 ms 344 KB Output is correct
21 Correct 40 ms 344 KB Output is correct
22 Correct 52 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 92 ms 344 KB Output is correct
8 Correct 8 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 20 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 16 ms 344 KB Output is correct
21 Correct 40 ms 344 KB Output is correct
22 Correct 52 ms 344 KB Output is correct
23 Correct 4 ms 436 KB Output is correct
24 Incorrect 162 ms 344 KB Too many queries.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory 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 372 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 8 ms 416 KB Output is correct
8 Incorrect 170 ms 344 KB Too many queries.
9 Halted 0 ms 0 KB -