oj.uz

Submission #730152

# Submission time Handle Problem Language Result Execution time Memory
730152 2023-04-25T10:55:32 Z Nahian9696 Rarest Insects (IOI22_insects) C++17
10 / 100
 335 ms 300 KB 
#include "insects.h"


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;


#define f0(i, n) for(int i = 0; i <  (n); i++)
#define f1(i, n) for(int i = 1; i <= (n); i++)
#define ff first
#define ss second
#define pb push_back




int min_cardinality(int N) {
    bool vis[N] = {0};
    int ret = 1e9;

    f0(i, N) {
        if(vis[i]) continue;
        vi lst;
        int cnt = 0;
        for(int cur = i; cur < N; cur++) {
            if(vis[cur]) continue;
            move_inside(cur);
            int crd = press_button();
            if(crd > cnt) {
                cnt++;
                lst.pb(cur);
                vis[cur] = true;
            } else {
                move_outside(cur);
            }
        }
        ret = min(ret, cnt);
        for(int ins: lst) move_outside(ins);
    }
    
    return ret;
    
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 3 ms 300 KB Output is correct
7 Correct 137 ms 208 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Correct 14 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 42 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 16 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 11 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 14 ms 208 KB Output is correct
20 Correct 40 ms 208 KB Output is correct
21 Correct 69 ms 208 KB Output is correct
22 Correct 130 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 3 ms 300 KB Output is correct
7 Correct 137 ms 208 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Correct 14 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 42 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 16 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 11 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 14 ms 208 KB Output is correct
20 Correct 40 ms 208 KB Output is correct
21 Correct 69 ms 208 KB Output is correct
22 Correct 130 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Incorrect 312 ms 208 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 15 ms 300 KB Output is correct
8 Incorrect 335 ms 208 KB Too many queries.
9 Halted 0 ms 0 KB -