제출 #831592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831592		ALeonidou	버섯 세기 (IOI20_mushrooms)	C++17	25 / 100	91 ms	256 KiB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

#define ll int
#define F first
#define S second
#define sz(x) (ll)x.size()
#define MID ((l+r)/2)
#define pb push_back
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define dbg4(x,y,z,w) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<endl;
#define INF 1e9
typedef vector <ll> vi;
typedef pair<ll,ll> ii;
typedef vector <ii> vii;

void printVct(vi &v, string s =""){
    if (sz(s) > 0) cout<<s<<": ";
    for (ll i=0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

void tabb(ll n) {
    for (ll i= 0; i<n; i++) cout<<"\t";
}

int count_mushrooms(int n) {
    ll ans = 1;
    ll u;
    for (ll i=2; i<n; i+=2){
        u = use_machine({i-1, 0, i});
        ans += 2-u;
    }
    if (n%2 == 0){
        u = use_machine({0, n-1});
        ans += 1-u;
    }
    return ans;
}

• Subtask 1: 25 / 100