제출 #432628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432628		Blistering_Barnacles	버섯 세기 (IOI20_mushrooms)	C++14	0 / 100	13 ms	13312 KiB

mushrooms

#include "mushrooms.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
int count_mushrooms(int n) {
	if(n <= 15){
        ll ret = 1 ;
        for(ll i = 2 ; i < n ; i += 2){
            ll pp = use_machine({i - 1 , 0 , i}) ;
            if(pp == 2)C ;
            if(!pp)ret += 2 ;
            else ret++ ;
        }
        if(!(n & 1)){
            ll pp = use_machine({n - 1 , 0}) ;
            ret += !pp ;
        }
        R ret ;
	}
	ll ret = 1 ;
	k = 1 ;
	for(ll i = 1 ; i + 3 < n ; i += 4){
        k = i + 3 ;
        ll pp = use_machine({0 , i , 0 , i + 1 , 0 , i + 2 , 0 , i + 3 , 0}) ;
        pp /= 2 ;
        ret += 4 - pp ;
	}
	vll tmp ;
	m = 0 ;
	for(ll i = n - 1 ; i >= k ; i--){
        tmp.pb(0) ;
        tmp.pb(i) ;
        m++ ;
	}
	if(sz(tmp)){
        tmp.pb(0) ;
        for(auto u : tmp)cout << u << " " ;
        ll pp = use_machine(tmp) ;
        pp /= 2 ;
        ret += m - pp ;
	}
	R ret ;
}

• Subtask 1: 0 / 100