oj.uz

Submission #1024658

# Submission time Handle Problem Language Result Execution time Memory
1024658 2024-07-16T08:58:15 Z mansur Rarest Insects (IOI22_insects) C++17
10 / 100
 240 ms 600 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>;

mt19937_64 rng(131415889);

int min_cardinality(int n) {
    vector<pair<int, vector<int>>> s;
    vector<int> p(n);
    for (int i = 0; i < n; i++) p[i] = i;
    shuffle(all(p), rng);
    s.push_back({1, {p[0]}});
    move_inside(p[0]);
    for (int i = 1; i < n; i++) {
        move_inside(p[i]);
        if (press_button() > 1) {
            bool ok = 0;
            sort(rall(s));
            for (int j = 0; j < sz(s); j++) {   
                if (s[j].f >= n / sz(s)) continue;
                move_outside(s[j].s.back());
                if (press_button() == 1) {
                    s[j].s.push_back(p[i]);
                    s[j].f++;
                    ok = 1;
                    break;
                }
                move_inside(s[j].s.back());
            }
            if (!ok) move_outside(p[i]);
            continue;
        }
        s.push_back({1, {p[i]}});
    }
    sort(all(s));
    return s[0].f;
}

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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 19 ms 444 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 436 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 19 ms 344 KB Output is correct
22 Correct 5 ms 444 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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 19 ms 444 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 436 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 19 ms 344 KB Output is correct
22 Correct 5 ms 444 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 96 ms 444 KB Output is correct
26 Correct 88 ms 420 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Incorrect 235 ms 440 KB Too many queries.
29 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 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 20 ms 460 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Incorrect 240 ms 432 KB Too many queries.
10 Halted 0 ms 0 KB -