oj.uz

Submission #627246

# Submission time Handle Problem Language Result Execution time Memory
627246 2022-08-12T11:37:51 Z model_code Rarest Insects (IOI22_insects) C++17
10 / 100
 463 ms 332 KB 
// protocol_violation/solution-o-n-ans.cpp
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {
  int colors = 0;
  vector <int> insects(N);
  iota(insects.begin(), insects.end(), 0);
  for (int ans = 0; true; ans++) {
    int cnt = 0;
    vector <int> next;
    for (int x : insects) {
      move_inside(x);
      if (press_button() == ans + 1) {
        cnt++;
      }
      else {
        move_outside(x);
        next.push_back(x);
      }
    }
    insects = next;
    if (ans == 0) {
      colors = cnt;
    }
    if (colors != cnt) {
      return ans;
    }
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 236 ms 208 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 16 ms 300 KB Output is correct
9 Correct 11 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 34 ms 304 KB Output is correct
15 Correct 30 ms 208 KB Output is correct
16 Correct 20 ms 208 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 10 ms 304 KB Output is correct
20 Correct 3 ms 300 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 236 ms 208 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 16 ms 300 KB Output is correct
9 Correct 11 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 34 ms 304 KB Output is correct
15 Correct 30 ms 208 KB Output is correct
16 Correct 20 ms 208 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 10 ms 304 KB Output is correct
20 Correct 3 ms 300 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Incorrect 284 ms 308 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 244 KB Output is correct
7 Incorrect 463 ms 332 KB Too many queries.
8 Halted 0 ms 0 KB -