oj.uz

Submission #1067266

# Submission time Handle Problem Language Result Execution time Memory
1067266 2024-08-20T13:43:10 Z j_vdd16 Rarest Insects (IOI22_insects) C++17
0 / 100
 1 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) {
    vi types(N);
    vb isNewType(N);
    loop(i, N) {
        move_inside(i);
        
        int res = press_button();
        if (res < 2) {
            isNewType[i] = true;
        }
        else {
            move_outside(i);
        }
    }

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

    int least = INT_MAX;
    int count = 0;
    loop(i, N) {
        if(isNewType[i]) {
            continue;
        }

        move_inside(i);
        int res = press_button();
        move_outside(i);

        count += res;
        least = min(least, res);
    }

    if (count < N) {
        return 1;
    }

    return least;
}

Subtask #1
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 1 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

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 1 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -