제출 #313973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
313973		nonthaphat	버섯 세기 (IOI20_mushrooms)	C++14	91.87 / 100	10 ms	512 KiB

mushrooms

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;

typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piipi;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
typedef pair<ll, pii> plpii;
typedef pair<db, db> pdd;
typedef pair<ld, ld> pldd;

typedef vector<int> vi;
typedef vector<pii> vii;
 
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define FOR2(i, a, b) for(int i=(a);i<=(b);++i)
#define ROF(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define ROF2(i, a, b) for(int i=(b);i>=(a);--i)
#define GO(i, x) for(auto &i : x)

#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define eb emplace_back
#define pf push_front
#define pb push_back
#define lb lower_bound
#define up upper_bound

template<typename T> inline bool min2(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline bool max2(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
 
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int P1 = 999983, P2 = 999979;
const ld PI = acos((ld)-1);
const int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const ll INF = 1e18;
const int N = 1e6;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int M = 100;
int use_machine(vector<int> x);
int count_mushrooms(int n){
    int count_A = 1, count_B = 0;
    int i = 1;
    vector<int> A, B;
    A.push_back(0);
    if(n <= 227){
        while(i < n){
            vector<int> x;
            x.push_back(0);
            x.push_back(i);
            int result = use_machine(x);
            if(result == 0){
                A.push_back(i);
                count_A++;
            }
            else{
                B.push_back(i);
                count_B++;
            }
            i++;
        }
        return count_A;
    }
    while(count_A < 2 && count_B < 2){
        vector<int> x;
        x.push_back(0);
        x.push_back(i);
        int result = use_machine(x);
        if(result == 0){
            A.push_back(i);
            count_A++;
        }
        else{
            B.push_back(i);
            count_B++;
        }
        i++;
    }
    while(count_A < M && count_B < M){
        bool sw = 0;
        if(count_A < count_B){
            sw = 1;
            swap(A, B);
            swap(count_A, count_B);
        }
        vector<int> x;
        x.push_back(i);
        x.push_back(A[0]);
        x.push_back(i+1);
        x.push_back(A[1]);
        int result = use_machine(x);
        switch(result){
            case 0: 
                A.push_back(i);
                A.push_back(i+1);
                count_A += 2;
                break;
            case 1:
                B.push_back(i);
                A.push_back(i+1);
                count_A++;
                count_B++;
                break;
            case 2:
                A.push_back(i);
                B.push_back(i+1);
                count_A++;
                count_B++;
                break;
            default:
                B.push_back(i);
                B.push_back(i+1);
                count_B += 2;
        }
        if(sw){
            swap(A, B);
            swap(count_A, count_B);
        }
        i += 2;
    }
        while(count_A + count_B < n){
            vector<int> x;
            bool sw = 0;
            if(sz(A) < sz(B)){
                sw = 1;
                swap(A, B);
                swap(count_A, count_B);
            }
 
            int le = min(sz(A), n-i);
            for(int j=0;j<le;j++){
                x.push_back(i+j);
                x.push_back(A[j]);
            }
 
            int result = use_machine(x);
            if(result%2 == 0) A.push_back(i), count_A++;
            else B.push_back(i), count_B++;
            count_A += (le-1) - result/2;
            count_B += result/2;
            i += le;
 
            if(sw){
                swap(A, B);
                swap(count_A, count_B);
            }
        }
    return count_A;
}

• Subtask 1: 91.8699 / 100