oj.uz

Submission #859056

# Submission time Handle Problem Language Result Execution time Memory
859056 2023-10-09T15:28:23 Z thinknoexit Rarest Insects (IOI22_insects) C++17
25 / 100
 236 ms 844 KB 
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
const int C = 10;
int min_cardinality(int n) {
    int type = 0;
    for (int i = 0;i < n;i++) {
        move_inside(i);
        if (press_button() == 2) {
            move_outside(i);
        }
        else in[i] = 1, type++;
    }
    if (type == 1) return n;
    if (type == n) return 1;
    if (type > n / 2) return 1;
    int mxans = n / type;
    int now = 1;
    while (now + C <= mxans) {
        now += C;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt < C * type) {
            for (int i = 0;i < n;i++) {
                if (in[i] == now) move_outside(i), in[i] = 0;
            }
            now -= C;
            while (1) {
                now++;
                int cnt = 0;
                for (int i = 0;i < n;i++) {
                    if (in[i]) continue;
                    move_inside(i);
                    if (press_button() > now) {
                        move_outside(i);
                    }
                    else in[i] = now, cnt++;
                }
                if (cnt != type) return now - 1;
            }
        }
    }
    while (now <= mxans) {
        now++;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt != type) return now - 1;
    }
    // n , n , n
    /*
        ans <= n / type
        ans <= n - mx
    */
    return -1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 16 ms 420 KB Output is correct
26 Correct 37 ms 588 KB Output is correct
27 Correct 16 ms 344 KB Output is correct
28 Correct 4 ms 812 KB Output is correct
29 Correct 18 ms 344 KB Output is correct
30 Correct 15 ms 344 KB Output is correct
31 Correct 59 ms 416 KB Output is correct
32 Correct 44 ms 436 KB Output is correct
33 Correct 47 ms 416 KB Output is correct
34 Correct 21 ms 420 KB Output is correct
35 Correct 29 ms 344 KB Output is correct
36 Correct 28 ms 416 KB Output is correct
37 Correct 22 ms 844 KB Output is correct
38 Correct 15 ms 600 KB Output is correct
39 Correct 9 ms 600 KB Output is correct
40 Correct 6 ms 600 KB Output is correct
41 Correct 7 ms 600 KB Output is correct

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 1 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 600 KB Output is correct
9 Partially correct 34 ms 600 KB Output is partially correct
10 Partially correct 51 ms 412 KB Output is partially correct
11 Correct 34 ms 344 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Partially correct 44 ms 600 KB Output is partially correct
14 Correct 26 ms 600 KB Output is correct
15 Incorrect 236 ms 420 KB Too many queries.
16 Halted 0 ms 0 KB -