oj.uz

답안 #1074297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074297 2024-08-25T09:29:57 Z c2zi6 드문 곤충 (IOI22_insects) C++17
25 / 100
 266 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 n, D;

int solution1() {
    VI vis(n);
    int ans = 2e9;
    replr(i, 0, n-1) if (!vis[i]) {
        vis[i] = true;
        movein(i);
        int cnt = 1;
        replr(j, i+1, n-1) if (!vis[j]) {
            movein(j);
            if (press_button() == 2) {
                vis[j] = true;
                cnt++;
            }
            moveout(j);
        }
        setmin(ans, cnt);
        moveout(i);
    }
    return ans;
}
int solution2() {
    VI vis(n);
    int k = -1;
    int ans = 0;
    replr(i, 0, n-1) if (!vis[i]) {
        vis[i] = true;
        movein(i);
        VI a;
        a.pb(i);
        replr(j, i+1, n-1) if (!vis[j]) {
            movein(j);
            if (press_button() == 2) {
                moveout(j);
            } else {
                vis[j] = true;
                a.pb(j);
            }
        }
        for (int i : a) moveout(i);
        if (k == -1) {
            k = a.size();
        } else if (a.size() != k) break;
        ans++;
    }
    return ans;
}

int min_cardinality(int N) {
    rng = mt19937(chrono::steady_clock().now().time_since_epoch().count());
    n = N;
    rngind = VI(n);
    rep(i, n) rngind[i] = i;
    /*shuffle(all(rngind), rng);*/
    if (true) {
        movein(0);
        VI a;
        a.pb(0);
        replr(j, 1, n-1) {
            movein(j);
            if (press_button() == 2) moveout(j);
            else a.pb(j);
        }
        for (int i : a) moveout(i);
        D = a.size();
    }

    if (D < sqrt(n)) return solution1();
    return solution2();


    return -1;

}

Compilation message

insects.cpp: In function 'int solution2()':
insects.cpp:86:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |         } else if (a.size() != k) break;
      |                    ~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 12 ms 344 KB Output is correct
25 Correct 109 ms 600 KB Output is correct
26 Correct 111 ms 344 KB Output is correct
27 Correct 6 ms 600 KB Output is correct
28 Correct 15 ms 344 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 123 ms 344 KB Output is correct
31 Correct 20 ms 344 KB Output is correct
32 Correct 43 ms 344 KB Output is correct
33 Correct 46 ms 444 KB Output is correct
34 Correct 27 ms 344 KB Output is correct
35 Correct 60 ms 600 KB Output is correct
36 Correct 57 ms 344 KB Output is correct
37 Correct 51 ms 344 KB Output is correct
38 Correct 22 ms 344 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 13 ms 344 KB Output is correct
41 Correct 20 ms 344 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 428 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 17 ms 344 KB Output is correct
8 Correct 23 ms 600 KB Output is correct
9 Incorrect 266 ms 452 KB Too many queries.
10 Halted 0 ms 0 KB -