제출 #352317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
352317		amunduzbaev	Counting Mushrooms (IOI20_mushrooms)	C++14	0 / 100	1 ms	364 KiB

mushrooms

#include "mushrooms.h"
#ifndef EVAL
#include "stub.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 2e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int count_mushrooms(int n){
	vector<int> a = {0};
	for(int i=1;i<n;i++){
		a.pb(i);
		a.pb(0);
	}
	int ans = use_machine(a);
	return ans/2+1;
}

• Subtask 1: 0 / 100