oj.uz

답안 #1058106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058106 2024-08-14T08:29:52 Z Dan4Life 드문 곤충 (IOI22_insects) C++17
0 / 100
 1 ms 344 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
using vi = vector<int>;
int D, inside[3000];

int min_cardinality(int n) {
    for(int i = 0; i < n; i++){
        move_inside(i);
        if(press_button()>1) move_outside(i);
        else inside[i]=1, D++;
    }
    int l = 1, r = n/D, p=1, tot=D;
    while(l<r){
        int mid = (l+r+1)/2;
        vi undo; undo.clear();
        for(int i = 0; i < n; i++)
            if(inside[i] > mid and mid<p)
                move_outside(i), inside[i]=0, tot--;
        for(int i = 0; i < n; i++){
            if(inside[i] or tot==D*mid) continue;
            if(press_button()>mid) move_outside(i);
            else inside[i]=mid, tot++, undo.pb(i);
        }
        if(tot==D*mid) l = mid;
        else{
            for(auto u : undo) move_outside(u);
            r=mid-1;
        }
        p=mid;
    }
    return l;
}

Subtask #1
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 344 KB Output is correct
4 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -