Submission #162405

#	Time	Username	Problem	Language	Result	Execution time	Memory
162405		MvC	Political Development (BOI17_politicaldevelopment)	C++11	16 / 100	20 ms	7928 KiB

politicaldevelopment

#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=5e3+5;
const int mod=1e9+7;
using namespace std;
int n,k,x,i,j,d[nmax];
bitset<nmax>b[nmax];
vector<int>g[nmax];
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);
	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++)
	{
		for(j=0;j<(int)g[i].size();j++)
		{
			x=g[i][j];
			if((b[i]&b[x]).any())rc(3);
		}
	}
	for(i=1;i<=n;i++)
	{
		if(d[i])rc(2);
	}
	cout<<1<<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")

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23