제출 #631788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
631788		garam1732	드문 곤충 (IOI22_insects)	C++17	99.89 / 100	62 ms	748 KiB

insects

#include "insects.h"
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <algorithm>
#include <cassert>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pi;

//vector<int> ans;
//stack<pi> S, v;
vector<int> v, w, u[2020];
set<int> s;

int min_cardinality(int N) {
//    v.clear(); w.clear(); s.clear();
//    for(int i = 0; i < 2020; i++) u[i].clear();

    int num = 0;
    for(int i = 0; i < N; i++) {
        move_inside(i);
        num++;
        if(i == 0) continue;
        if(press_button() > 1) {
            move_outside(i);
            num--;
            s.insert(i);
        }
    }

    if(num == 1) return N;

    //cout<<num<<endl;
    int sum = num;
    int lb = 1, ub = N/num, mid;
    while(lb < ub) {
        mid = lb+ub+1>>1;
        for(int i : s) {
            move_inside(i);
            int x = press_button();
            if(x > mid) {
                w.push_back(i);
                move_outside(i);
                continue;
            }
            u[x].push_back(i);
            sum++;
        }

        bool flag = false;
        while(lb < ub) {
            mid = lb+ub+1>>1;

//            for(int i = lb; i <= ub+1; i++) {
//                cout<<i<<" : ";
//                for(int t:u[i])cout<<t<<" ";
//                cout<<endl;
//            }
//            cout<<endl;
            if(flag) {
                for(int i = ub+1; i > mid; i--) {
                    for(int t : u[i]) {
                        move_outside(t);
                        sum--;
                    }
                }

                //assert(press_button() == mid);
                for(int i = mid+1; i <= ub+1; i++) {
                    w.push_back(u[i][0]);
                    for(int j = 1; j < u[i].size(); j++) {
                        int t = u[i][j];
                        move_inside(t);
                        if(press_button() > mid) {
                            move_outside(t);
                            w.push_back(t);
                        }
                        else {
                            sum++;
                            u[mid].push_back(t);
                        }
                    }
                }
            }
            flag = true;
            //cout<<sum<<endl;

            if(sum == mid*num) {
                for(int i = lb+1; i <= mid; i++)
                    for(int t : u[i])
                        s.erase(t);
                for(int i = lb+1; i <= ub+1; i++) u[i].clear();
                lb = mid;
                w.clear();
                break;
            }
            else {
                for(int t : w) s.erase(t);
//                for(int t : u[mid]) move_outside(t);
//                sum -= u[mid].size();
                for(int i = mid+1; i <= ub+1; i++) u[i].clear();
                w.clear();
                ub = mid-1;
            }
        }
    }

    return lb;
}

컴파일 시 표준 에러 (stderr) 메시지

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:40:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |         mid = lb+ub+1>>1;
      |               ~~~~~^~
insects.cpp:55:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |             mid = lb+ub+1>>1;
      |                   ~~~~~^~
insects.cpp:74:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                     for(int j = 1; j < u[i].size(); j++) {
      |                                    ~~^~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 74.89 / 75