Submission #1421121
Source Code Expand
#include<string> #include<deque> #include<queue> #include<vector> #include<algorithm> #include<iostream> #include<set> #include<cmath> #include<tuple> #include<chrono> #include<functional> #include<random> #include<unordered_set> using namespace std; typedef long long int llint; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase const int mod=1000000007; const int big=1e9+10; const long double pai=3.141592653589793238462643383279; template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}} template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}} llint gcd(llint a,llint b){if(b==0){return a;}return gcd(b,a%b);}//a>b llint lcm(llint a,llint b){return (a/gcd(max(a,b),min(a,b)))*b;} int main(void){ int n,m,q,i,j,zyu=1,nai=0;cin>>n>>m>>q; vector<int>ban(q);//入力 番号 vector<deque<int>>numlis(m+1);//どこに番号があるのだろう? multiset<int>las;//最後に番号入れたのいつ? vector<bool>mita(m+1); for(i=0;i<n;i++){las.ins(big);} for(i=0;i<q;i++){ int in;cin>>in; ban[i]=in; numlis[in].puf(i); } for(i=q-1;i>=0;i--){ int no=ban[i]; if(mita[no]){continue;}//skipped bool mincan=false; while(mita[zyu]){zyu++;} mita[no]=true; mincan=(zyu==no); vector<int>iti; for(j=0;j<n;j++){ if(j>=numlis[no].size()){break;} auto it=las.lower_bound(numlis[no][j]); if(it==las.end()){break;} iti.pub(*it); las.erase(it); } if(j<n&&(!mincan)){cout<<"No"<<endl;return 0;} for(;j<n-nai;j++){ auto it=las.lower_bound(-1); iti.pub(-999); las.erase(it); nai++; } while(iti.size()!=0){las.ins(iti.back());iti.pob();} //cout<<endl<<"de i="<<i; //for(auto it=las.begin();it!=las.end();it++){cout<<" "<<(*it);} } cout<<"Yes"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | WA_TLE |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1973 Byte |
Status | RE |
Exec Time | 110 ms |
Memory | 22272 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | RE | 108 ms | 22272 KB |
0_01.txt | RE | 108 ms | 22272 KB |
0_02.txt | RE | 107 ms | 22272 KB |
1_00.txt | RE | 108 ms | 22272 KB |
1_01.txt | RE | 107 ms | 22272 KB |
1_02.txt | RE | 110 ms | 22272 KB |