oj.uz

답안 #627775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627775 2022-08-12T22:51:16 Z ETK 드문 곤충 (IOI22_insects) C++17
10 / 100
 355 ms 208 KB 
#include <bits/stdc++.h>
#include "insects.h"
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int n,a[N],b[N];
// void move_inside(int i){
//     ++b[a[i]];
// }
// void move_outside(int i){
//     --b[a[i]];
// }
// int press_button(){
//     int mx = 0;
//     rep(i,1,n)mx = max(mx,b[i]);
//     return mx;
// }
int min_cardinality(int n){
    int cnt = 0;
    vi vis(n,0);
    rep(i,0,n - 1){
        move_inside(i);
        //appeared before
        if(press_button() > 1)move_outside(i);
        else vis[i] = 1,cnt++;
    }
    int tmp = cnt;
    rep(k,2,n){
        rep(i,0,n - 1){
            if(vis[i])continue;
            move_inside(i);
            if(press_button() > k)move_outside(i);
            else vis[i] = 1,tmp++;
        }
        if(tmp < k * cnt){
            return k - 1;
        }
    }
    return n;
}
// int main(){
//     cin >> n;
//     rep(i,0,n - 1)cin >> a[i];
//     cout << min_cardinality(n) << '\n';
// }

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 165 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 12 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 30 ms 208 KB Output is correct
15 Correct 24 ms 208 KB Output is correct
16 Correct 17 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Incorrect 355 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 1 ms 208 KB Output is correct
7 Incorrect 333 ms 208 KB Too many queries.
8 Halted 0 ms 0 KB -