Submission #162424

#TimeUsernameProblemLanguageResultExecution timeMemory
162424MvCPolitical Development (BOI17_politicaldevelopment)C++11
16 / 100
2930 ms312104 KiB
#pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #include <bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=5e4+5; const int mod=1e9+7; using namespace std; int n,k,x,i,j,d[nmax],nr,rs; bitset<nmax>b[nmax],viz; vector<int>g[nmax],vc,rnd; int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); srand(time(0)); cin>>n>>k; for(i=1;i<=n;i++) { cin>>d[i]; for(j=1;j<=d[i];j++) { cin>>x; x++; b[i][x]=1; g[i].pb(x); } } for(i=1;i<=n;i++)rnd.pb(i); while(clock()/(double)CLOCKS_PER_SEC<=2.9) { random_shuffle(rnd.begin(),rnd.end()); for(int i=0;i<(int)vc.size();i++)viz[vc[i]]=0; vc.clear(); for(i=0;i<n;i++) { x=rnd[i]; nr=0; for(j=0;j<(int)vc.size();j++)nr+=b[x][vc[j]]; if(nr==(int)vc.size()) { vc.pb(x); viz[x]=1; } } rs=max(rs,(int)vc.size()); if(rs==k)break; } cout<<rs<<endl; return 0; }

Compilation message (stderr)

politicaldevelopment.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
politicaldevelopment.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...