oj.uz

Submission #859047

# Submission time Handle Problem Language Result Execution time Memory
859047 2023-10-09T15:02:22 Z thinknoexit Rarest Insects (IOI22_insects) C++17
10 / 100
 191 ms 600 KB 
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
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;
    int mxans = n / type;
    int sq = sqrt(n);
    int now = 1;
    // while (now + sq <= mxans) {
    //     now += sq;
    //     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 * sq) {
    //         for (int i = 0;i < n;i++) {
    //             if (in[i] == now) move_outside(i), in[i] = 0;
    //         }
    //         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;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:17:9: warning: unused variable 'sq' [-Wunused-variable]
   17 |     int sq = sqrt(n);
      |         ^~

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 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 17 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 17 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 73 ms 592 KB Output is correct
26 Correct 63 ms 432 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 6 ms 440 KB Output is correct
29 Correct 12 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Incorrect 191 ms 344 KB Too many queries.
32 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 1 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 8 ms 600 KB Output is correct
9 Incorrect 177 ms 416 KB Too many queries.
10 Halted 0 ms 0 KB -