제출 #335395

#제출 시각아이디문제언어결과실행 시간메모리
335395rocks03버섯 세기 (IOI20_mushrooms)C++14
0 / 100
3 ms364 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define ff first #define ss second #define pb push_back #define SZ(x) ((int)(x).size()) #define all(x) x.begin(), x.end() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int use_machine(vector<int> x); int count_mushrooms(int n){ vector<int> a, b; a.pb(0); int ans = 1; for(int i = 1; i < n; i++){ if(SZ(a) == 100){ i++; for(; i < n; i++){ vector<int> v; int j = i; while(j < n && j < i + 100){ v.pb(a[j - i]); v.pb(j); j++; } int res = use_machine(v); ans += SZ(v) - (res + 1) / 2; i = j - 1; } break; } if(SZ(b) == 100){ for(; i < n; i++){ vector<int> v; int j = i; while(j < n && j < i + 100){ v.pb(b[j - i]); v.pb(j); j++; } int res = use_machine(v); ans += (res + 1) / 2; i = j - 1; } break; } int res = use_machine({0, i}); if(res == 1){ b.pb(i); } else{ a.pb(i); ++ans; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...