Submission #351813

#TimeUsernameProblemLanguageResultExecution timeMemory
351813amunduzbaev버섯 세기 (IOI20_mushrooms)C++14
10 / 100
244 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 ans = 1; for(int i=1;i<n;i++){ vii tmp = {0, i}; if(!use_machine(tmp)) ans++; }return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...