oj.uz

Submission #162421

# Submission time Handle Problem Language Result Execution time Memory
162421 2019-11-08T08:24:35 Z MvC Political Development (BOI17_politicaldevelopment) C++11
4 / 100
 1004 ms 7864 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=5e3+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<=1)
	{
		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)g[x].size();j++)nr+=viz[g[x][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

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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 7 ms 3704 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 17 ms 3832 KB Output is correct
6 Correct 7 ms 3832 KB Output is correct
7 Correct 7 ms 3832 KB Output is correct
8 Correct 1000 ms 576 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 452 ms 592 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 7 ms 3704 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 17 ms 3832 KB Output is correct
6 Correct 7 ms 3832 KB Output is correct
7 Correct 7 ms 3832 KB Output is correct
8 Correct 1000 ms 576 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 452 ms 592 KB Output is correct
11 Correct 7 ms 3836 KB Output is correct
12 Correct 1000 ms 3848 KB Output is correct
13 Correct 1004 ms 508 KB Output is correct
14 Correct 1000 ms 3856 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 1000 ms 3868 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 1000 ms 3832 KB Output is correct
19 Correct 1000 ms 580 KB Output is correct
20 Incorrect 1000 ms 3832 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 580 KB Output is correct
2 Correct 1000 ms 520 KB Output is correct
3 Correct 1000 ms 604 KB Output is correct
4 Correct 1000 ms 516 KB Output is correct
5 Correct 1000 ms 504 KB Output is correct
6 Correct 1000 ms 524 KB Output is correct
7 Correct 1000 ms 520 KB Output is correct
8 Correct 1000 ms 604 KB Output is correct
9 Correct 1000 ms 528 KB Output is correct
10 Correct 1000 ms 528 KB Output is correct
11 Runtime error 51 ms 7864 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 7 ms 3704 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 17 ms 3832 KB Output is correct
6 Correct 7 ms 3832 KB Output is correct
7 Correct 7 ms 3832 KB Output is correct
8 Correct 1000 ms 576 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 452 ms 592 KB Output is correct
11 Correct 7 ms 3836 KB Output is correct
12 Correct 1000 ms 3848 KB Output is correct
13 Correct 1004 ms 508 KB Output is correct
14 Correct 1000 ms 3856 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 1000 ms 3868 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 1000 ms 3832 KB Output is correct
19 Correct 1000 ms 580 KB Output is correct
20 Incorrect 1000 ms 3832 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 7 ms 3704 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 17 ms 3832 KB Output is correct
6 Correct 7 ms 3832 KB Output is correct
7 Correct 7 ms 3832 KB Output is correct
8 Correct 1000 ms 576 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 452 ms 592 KB Output is correct
11 Correct 7 ms 3836 KB Output is correct
12 Correct 1000 ms 3848 KB Output is correct
13 Correct 1004 ms 508 KB Output is correct
14 Correct 1000 ms 3856 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 1000 ms 3868 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 1000 ms 3832 KB Output is correct
19 Correct 1000 ms 580 KB Output is correct
20 Incorrect 1000 ms 3832 KB Output isn't correct
21 Halted 0 ms 0 KB -