# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1021475 | 2024-07-12T18:41:57 Z | Ahmed_Solyman | 버섯 세기 (IOI20_mushrooms) | C++14 | 7 ms | 596 KB |
/* In the name of Allah made by: Ahmed_Solyman */ #include <bits/stdc++.h> using namespace std; typedef long long ll; int use_machine(vector<int>x); int count_mushrooms(int n){ if(n<=226){ int ret=1; for(int i=1;i<n;i++){ ret+=1-use_machine({0,i}); } return ret; } int ret=0,k=94; vector<int>v[2]; v[0].push_back(0); for(int i=1;i<=2*k-2;i++){ if(use_machine({0,i})==0)v[0].push_back(i); else v[1].push_back(i); } bool typ; vector<int>g; if(v[0].size()>=k){ typ=0; for(int i=0;i<k;i++)g.push_back(v[0][i]); } else{ typ=1; for(int i=0;i<k;i++)g.push_back(v[1][i]); } auto f=[&](int l,int r){ vector<int>p; for(int i=l;i<=r;i++){ p.push_back(i); p.push_back(g[i-l+1]); } int g=use_machine(p); g=(g+1)/2; if(typ)return g; else return r-l+1-g; }; ret=(int)v[0].size(); for(int i=2*k-1;i<n;i+=k){ ret+=f(i,min(i+k-1,n-1)); } return ret; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 2 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 428 KB | Output is correct |
7 | Partially correct | 4 ms | 344 KB | Output is partially correct |
8 | Partially correct | 6 ms | 344 KB | Output is partially correct |
9 | Partially correct | 5 ms | 344 KB | Output is partially correct |
10 | Partially correct | 5 ms | 344 KB | Output is partially correct |
11 | Partially correct | 7 ms | 344 KB | Output is partially correct |
12 | Incorrect | 4 ms | 344 KB | Answer is not correct. |
13 | Halted | 0 ms | 0 KB | - |