oj.uz

Submission #162425

# Submission time Handle Problem Language Result Execution time Memory
162425 2019-11-08T08:33:51 Z MvC Political Development (BOI17_politicaldevelopment) C++11
0 / 100
 2929 ms 312212 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;
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());
		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);
			}
			else break;
		}
		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 346 ms 22648 KB Output is correct
4 Correct 378 ms 22008 KB Output is correct
5 Correct 42 ms 21880 KB Output is correct
6 Correct 294 ms 21944 KB Output is correct
7 Correct 79 ms 21880 KB Output is correct
8 Correct 2900 ms 1700 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Incorrect 2900 ms 1708 KB Output isn't correct

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 346 ms 22648 KB Output is correct
4 Correct 378 ms 22008 KB Output is correct
5 Correct 42 ms 21880 KB Output is correct
6 Correct 294 ms 21944 KB Output is correct
7 Correct 79 ms 21880 KB Output is correct
8 Correct 2900 ms 1700 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Incorrect 2900 ms 1708 KB Output isn't correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2900 ms 1696 KB Output is correct
2 Correct 2900 ms 1636 KB Output is correct
3 Correct 2900 ms 1644 KB Output is correct
4 Correct 2900 ms 1616 KB Output is correct
5 Correct 2900 ms 1680 KB Output is correct
6 Correct 2900 ms 1656 KB Output is correct
7 Correct 2900 ms 1656 KB Output is correct
8 Correct 2900 ms 1636 KB Output is correct
9 Correct 2900 ms 1528 KB Output is correct
10 Correct 2900 ms 1656 KB Output is correct
11 Incorrect 2929 ms 312212 KB Output isn't correct
12 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 346 ms 22648 KB Output is correct
4 Correct 378 ms 22008 KB Output is correct
5 Correct 42 ms 21880 KB Output is correct
6 Correct 294 ms 21944 KB Output is correct
7 Correct 79 ms 21880 KB Output is correct
8 Correct 2900 ms 1700 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Incorrect 2900 ms 1708 KB Output isn't correct

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 346 ms 22648 KB Output is correct
4 Correct 378 ms 22008 KB Output is correct
5 Correct 42 ms 21880 KB Output is correct
6 Correct 294 ms 21944 KB Output is correct
7 Correct 79 ms 21880 KB Output is correct
8 Correct 2900 ms 1700 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Incorrect 2900 ms 1708 KB Output isn't correct