oj.uz

Submission #1067300

# Submission time Handle Problem Language Result Execution time Memory
1067300 2024-08-20T14:17:13 Z j_vdd16 Rarest Insects (IOI22_insects) C++17
10 / 100
 292 ms 344 KB 
#include "insects.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

int min_cardinality(int N) {
    int idx = 0;
    vb isDone(N);

    int prevNewTypes = 0;
    for (;; idx++) {
        vb isNewType(N);

        int newTypes = 0;
        loop(i, N) {
            if(isDone[i]) 
                continue;

            move_inside(i);
            
            int res = press_button();
            if (res <= idx + 1) {
                newTypes++;
                isNewType[i] = true;
                isDone[i] = true;
            }
            else {
                move_outside(i);
            }
        }

        if (newTypes < prevNewTypes) {
            break;
        }
        prevNewTypes = newTypes;

        // loop(i, N) {
        //     if(isNewType[i])
        //         move_outside(i);
        // }
    }

    return idx;
}

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 102 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 11 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 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 102 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 11 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Incorrect 201 ms 344 KB Too many queries.
24 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 Incorrect 292 ms 344 KB Too many queries.
8 Halted 0 ms 0 KB -