oj.uz

Submission #162436

# Submission time Handle Problem Language Result Execution time Memory
162436 2019-11-08T08:53:24 Z MvC Political Development (BOI17_politicaldevelopment) C++11
0 / 100
 3000 ms 22392 KB 
#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,ts;
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);
	ts=300000000/(n+n*k/2);
	while(ts--)
	{
		random_shuffle(rnd.begin(),rnd.end());
		vc.clear();
		for(i=0;i<n;i++)
		{
			x=rnd[i];
			nr=0;
			for(j=0;j<(int)vc.size();j++)
			{
				if(!b[x][vc[j]])break;
				nr++;
			}
			if(nr==(int)vc.size())vc.pb(x);
		}
		rs=max(rs,(int)vc.size());
		if(rs==k)break;
	}
	cout<<rs<<endl;
	return 0;
}

Compilation message

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")

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 23 ms 22392 KB Output is correct
4 Correct 21 ms 21624 KB Output is correct
5 Correct 21 ms 21624 KB Output is correct
6 Correct 22 ms 21752 KB Output is correct
7 Correct 22 ms 21752 KB Output is correct
8 Execution timed out 3041 ms 1656 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 23 ms 22392 KB Output is correct
4 Correct 21 ms 21624 KB Output is correct
5 Correct 21 ms 21624 KB Output is correct
6 Correct 22 ms 21752 KB Output is correct
7 Correct 22 ms 21752 KB Output is correct
8 Execution timed out 3041 ms 1656 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3022 ms 1656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 23 ms 22392 KB Output is correct
4 Correct 21 ms 21624 KB Output is correct
5 Correct 21 ms 21624 KB Output is correct
6 Correct 22 ms 21752 KB Output is correct
7 Correct 22 ms 21752 KB Output is correct
8 Execution timed out 3041 ms 1656 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 23 ms 22392 KB Output is correct
4 Correct 21 ms 21624 KB Output is correct
5 Correct 21 ms 21624 KB Output is correct
6 Correct 22 ms 21752 KB Output is correct
7 Correct 22 ms 21752 KB Output is correct
8 Execution timed out 3041 ms 1656 KB Time limit exceeded
9 Halted 0 ms 0 KB -