제출 #352369

#제출 시각아이디문제언어결과실행 시간메모리
352369amunduzbaevCounting Mushrooms (IOI20_mushrooms)C++14
25 / 100
134 ms492 KiB
#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){
	int i = 1;
	int cnt = 1;
	for( i=1;i+1<n;i += 2){
		vii tmp = {i, 0, i+1}; 
		int tt = use_machine(tmp);
		if(tt == 1) cnt ++;
		if(tt == 0) cnt += 2;
	}
	if(i < n){
		vii tmp = {0, i};
		int tt = use_machine(tmp);
		if(!tt) cnt++;
	}
	return cnt;
}
#Verdict Execution timeMemoryGrader output
Fetching results...