Submission #353068

#	Time	Username	Problem	Language	Result	Execution time	Memory
353068		talant117408	버섯 세기 (IOI20_mushrooms)	C++17	0 / 100	1 ms	364 KiB

mushrooms

#include "mushrooms.h"
#ifndef EVAL
#include "stub.cpp"
#endif
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}

inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}

class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n);
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;

            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);

            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};

const int mod = 1e9+7;

ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}

ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}

ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}

ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}

ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int ans = 1;
vector <int> a, b;

int count_mushrooms(int n){
    if(n == 2){
        vector <int> tmp;
        tmp.pb(0); tmp.pb(1);
        return 2-use_machine(tmp);
    }
    a.pb(0);
    
    vector <int> tmp;
    tmp.pb(0);
    tmp.pb(1);
    if(use_machine(tmp) == 0){
        a.pb(1);
        ans++;
    }
    else{
        b.pb(1);
        tmp.pop_back();
        tmp.pb(2);
        if(use_machine(tmp) == 0){
            ans++;
            a.pb(2);
        }
        else{
            b.pb(2);
        }
    }
    
    int j = 1;
    
    while(j < n){
        if(sz(a) >= sz(b)){
            vector <int> tmp;
            int cnt = -1;
            for(int i = j; i < min(j+sz(a), n); i++){
                tmp.pb(a[i-j]); tmp.pb(i);
                cnt++;
            }
            j = min(j+sz(a), n);
            auto res = use_machine(tmp);
            if(res&1){
                b.pb(tmp.back());
                res--;
            }
            else{
                a.pb(tmp.back());
                ans++;
            }
            ans += cnt-res/2;
        }
        else{
            vector <int> tmp;
            int cnt = -1;
            for(int i = j; i < min(j+sz(b), n); i++){
                tmp.pb(b[i-j]); tmp.pb(i);
                cnt++;
            }
            j = min(j+sz(b), n);
            auto res = use_machine(tmp);
            if(res&1){
                a.pb(tmp.back());
                ans++;
                res--;
            }
            else{
                b.pb(tmp.back());
            }
            ans += res/2;
        }
    }
    
    return ans;
}

• Subtask 1: 0 / 100