Submission #484950

#TimeUsernameProblemLanguageResultExecution timeMemory
484950M4mouCounting Mushrooms (IOI20_mushrooms)C++17
0 / 100
0 ms200 KiB
#include <bits/stdc++.h> #include "mushrooms.h" #pragma GCC optimize ("Ofast") #pragma GCC target ("avx2") using namespace std; using ll = long long; using vi = vector<int>; #define pb push_back #define ff first #define ss second #define lb lower_bound #define all(x) (x).begin() , (x).end() //int use_machine(vector<int> a); int count_mushrooms(int n) { int cnt = 1; int k = 210; vector<int>arrA, arrB; for(int i = 1;i<k;i++){ vector<int> a; a = {0, i}; if(use_machine(a)) arrB.pb(i); else arrA.pb(i); } #define sz(x) (int)x.size() if(sz(arrA) >= sz(arrB)) { int i = k; while(i<n){ vector<int> a; for(int j : arrA){ a.pb(j); a.pb(i); i++; if(i == n)break; } int x = use_machine(a); cnt += (int)a.size() - (x+1)/2; } } else { int i = k; while(i<n){ vector<int> b; for(int j : arrB){ b.pb(j); b.pb(i); i++; if(i == n)break; } int x = use_machine(b); cnt += (x+1)/2; } } return cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...