oj.uz

답안 #627459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627459 2022-08-12T15:18:32 Z Carmel_Ab1 드문 곤충 (IOI22_insects) C++17
10 / 100
 428 ms 288 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
#include "insects.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

int small_distinct_vals(int n, int diff, vector<bool>in){
    int ans=1;
    while(1){
        int has=0;
        for(int i=0; i<n;i ++){
            if(in[i])continue;
            move_inside(i);
            in[i]=1;
            has++;
            if(press_button()!=ans+1)
                in[i]=0,has--, move_outside(i);
        }

        if(has!=diff)
            break;
        ans++;
    }
    return ans;

}

int min_cardinality(int n){
    int diff=0;
    vector<bool>in(n);
    for(int i=0; i<n; i++){
        move_inside(i),in[i]=1;
        diff++;
        if(press_button()!=1)
            move_outside(i),diff--,in[i]=0;
    }
    if(diff<=45)
        return small_distinct_vals(n, diff, in);

    for(int i=0; i<n;i ++)
        move_outside(i);

    vi color(n,-1);

    int c=0;

    while(count(all(color),-1)){
        int cur=0;
        for(int i=0; i<n; i++)
            if(color[i]==-1){
                move_inside(i);
                if(press_button()==cur+1)
                    cur++,color[i]=c;
                else
                    move_outside(i);
            }
        for(int i=0; i<n;i ++)
            if(color[i]==c)
                move_outside(i);
        c++;
    }

    vi cnt(n);
    for(int i=0; i<n; i++)
        cnt[color[i]]++;
    int ans=1e9;
    for(int i=0; i<n;i ++)
        if(cnt[i])
            ans=min(ans,cnt[i]);
    return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 129 ms 208 KB Output is correct
7 Correct 182 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 12 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 50 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 40 ms 208 KB Output is correct
15 Correct 29 ms 208 KB Output is correct
16 Correct 21 ms 208 KB Output is correct
17 Correct 15 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 37 ms 208 KB Output is correct
21 Correct 52 ms 208 KB Output is correct
22 Correct 73 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 129 ms 208 KB Output is correct
7 Correct 182 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 12 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 50 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 40 ms 208 KB Output is correct
15 Correct 29 ms 208 KB Output is correct
16 Correct 21 ms 208 KB Output is correct
17 Correct 15 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 37 ms 208 KB Output is correct
21 Correct 52 ms 208 KB Output is correct
22 Correct 73 ms 208 KB Output is correct
23 Incorrect 428 ms 208 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Incorrect 395 ms 208 KB Too many queries.
8 Halted 0 ms 0 KB -