oj.uz

Submission #1071708

# Submission time Handle Problem Language Result Execution time Memory
1071708 2024-08-23T10:17:31 Z c2zi6 Rarest Insects (IOI22_insects) C++17
10 / 100
 250 ms 600 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "insects.h"

mt19937 rng;
VI rngind;

void movein(int i) {
    move_inside(rngind[i]);
}

void moveout(int i) {
    move_outside(rngind[i]);
}

int min_cardinality(int n) {
    rng = mt19937(chrono::steady_clock().now().time_since_epoch().count());
    rngind = VI(n);
    rep(i, n) rngind[i] = i;
    shuffle(all(rngind), rng);

    VI a(n, -1);
    int last = 0;
    replr(i, 0, n-1) if (a[i] == -1) {
        a[i] = last;
        movein(i);
        replr(j, i+1, n-1) if (a[j] == -1) {
            movein(j);
            if (press_button() == 2) a[j] = a[i];
            moveout(j);
        }
        moveout(i);

        last++;
    }
    /*for (int x : a) cout << x << " "; cout << endl;*/
    VI cnt(n);
    for (int x : a) cnt[x]++;
    int ans = 2e9;
    for (int x : cnt) if (x) setmin(ans, x);
    return ans;
}

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 113 ms 436 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 444 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 26 ms 436 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 4 ms 444 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 8 ms 444 KB Output is correct
20 Correct 21 ms 592 KB Output is correct
21 Correct 34 ms 416 KB Output is correct
22 Correct 63 ms 592 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 113 ms 436 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 444 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 26 ms 436 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 4 ms 444 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 8 ms 444 KB Output is correct
20 Correct 21 ms 592 KB Output is correct
21 Correct 34 ms 416 KB Output is correct
22 Correct 63 ms 592 KB Output is correct
23 Correct 7 ms 448 KB Output is correct
24 Incorrect 244 ms 344 KB Too many queries.
25 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 10 ms 344 KB Output is correct
8 Incorrect 250 ms 344 KB Too many queries.
9 Halted 0 ms 0 KB -