oj.uz

Submission #1024618

# Submission time Handle Problem Language Result Execution time Memory
1024618 2024-07-16T08:41:13 Z vjudge1 Rarest Insects (IOI22_insects) C++17
0 / 100
 196 ms 464 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int) s.size()
#define s second 
#define f first 

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int min_cardinality(int n) {
    vector<vector<int>> s;
    s.push_back({{0}});
    move_inside(0);
    for (int i = 1; i < n; i++) {
        move_inside(i);
        if (press_button() > 1) {
            for (int j = 0; j < sz(s); j++) {   
                if (sz(s[j]) >= n / sz(s)) continue;
                move_outside(s[j].back());
                if (press_button() == 1) {
                    s[j].push_back(i);
                    break;
                }
                move_inside(s[j].back());
            }
            continue;
        }
        s.push_back({{i}});
    }
    int ans = n + 1;
    for (int i = 0; i < sz(s); i++) ans = min(ans, sz(s[i]));
    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 7 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 7 ms 344 KB Wrong answer.
9 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 10 ms 464 KB Output is correct
9 Incorrect 196 ms 436 KB Too many queries.
10 Halted 0 ms 0 KB -