oj.uz

Submission #859376

# Submission time Handle Problem Language Result Execution time Memory
859376 2023-10-10T05:49:37 Z thinknoexit Rarest Insects (IOI22_insects) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
set<int> candidate;
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++, candidate.insert(i);
    }
    if (type == 1) return n;
    if (type > n / 2) return 1;
    int mxans = n / type;
    int l = 1, r = mxans;
    int sz = type;
    while (l < r) {
        int mid = (l + r + 1) / 2;
        stack<int> s;
        for (auto i : candidate) {
            move_inside(i);
            if (press_button() > mid) move_outside(i);
            else in[i] = 1, s.push(i), sz++;
        }
        if (sz < type * mid) {
            if (r == l + 1) return l;
            while (!s.empty()) {
                in[s.top()] = 0;
                move_outside(s.top());
                sz--;
                s.pop();
            }
            r = mid - 1;
        }
        else {
            while (!s.empty()) candidate.insert(s.top()), s.pop();
            l = mid;
        }
    }
    return l;
}

Subtask #1
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 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -