oj.uz

Submission #197168

# Submission time Handle Problem Language Result Execution time Memory
197168 2020-01-19T12:26:35 Z arnold518 Political Development (BOI17_politicaldevelopment) C++14
16 / 100
 3000 ms 5492 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 5e4;

int N, K, ans=1;
vector<int> adj[MAXN+10];
bool vis[MAXN+10];

int main()
{
	int i, j, k, p;
	scanf("%d%d", &N, &K);
	for(i=1; i<=N; i++)
	{
		int s;
		scanf("%d", &s);
		while(s--) { int t; scanf("%d", &t); adj[i].push_back(t+1); }
	}
	for(i=1; i<=N; i++) sort(adj[i].begin(), adj[i].end());

	while(1)
	{
		pii t(987654321, 0);
		for(i=1; i<=N; i++) if(!vis[i]) t=min(t, pii(adj[i].size(), i));
		if(t.second==0) break;
		int now=t.second;

		vector<int> chd;
		for(auto it : adj[now]) chd.push_back(it);

		for(i=0; i<(1<<chd.size()); i++)
		{
			vector<int> V;
			for(j=0; j<chd.size(); j++) if(i&(1<<j)) V.push_back(chd[j]);
			bool flag=true;
			for(j=0; j<V.size(); j++)
			{
				for(k=j+1, p=0; k<V.size(); k++)
				{
					for(; p<adj[V[j]].size() && adj[V[j]][p]<V[k]; p++);
					if(adj[V[j]][p]!=V[k]) flag=false;
				}
			}
			if(flag) ans=max(ans, (int)V.size()+1); 
		}
		vis[now]=true;
		for(auto it : chd) adj[it].erase(lower_bound(adj[it].begin(), adj[it].end(), now));
		adj[now].clear();
	}
	printf("%d", ans);
}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:39:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0; j<chd.size(); j++) if(i&(1<<j)) V.push_back(chd[j]);
             ~^~~~~~~~~~~
politicaldevelopment.cpp:41:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0; j<V.size(); j++)
             ~^~~~~~~~~
politicaldevelopment.cpp:43:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(k=j+1, p=0; k<V.size(); k++)
                     ~^~~~~~~~~
politicaldevelopment.cpp:45:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(; p<adj[V[j]].size() && adj[V[j]][p]<V[k]; p++);
            ~^~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &K);
  ~~~~~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
   ~~~~~^~~~~~~~~~
politicaldevelopment.cpp:22:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   while(s--) { int t; scanf("%d", &t); adj[i].push_back(t+1); }
                       ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 122 ms 1784 KB Output is correct
4 Correct 50 ms 1660 KB Output is correct
5 Correct 50 ms 1656 KB Output is correct
6 Correct 53 ms 1656 KB Output is correct
7 Correct 55 ms 1912 KB Output is correct
8 Correct 46 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 45 ms 1528 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 122 ms 1784 KB Output is correct
4 Correct 50 ms 1660 KB Output is correct
5 Correct 50 ms 1656 KB Output is correct
6 Correct 53 ms 1656 KB Output is correct
7 Correct 55 ms 1912 KB Output is correct
8 Correct 46 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 45 ms 1528 KB Output is correct
11 Correct 51 ms 1716 KB Output is correct
12 Correct 52 ms 1656 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 50 ms 1656 KB Output is correct
15 Correct 1 ms 1528 KB Output is correct
16 Correct 55 ms 1804 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 57 ms 1656 KB Output is correct
19 Correct 47 ms 1528 KB Output is correct
20 Correct 71 ms 1692 KB Output is correct
21 Correct 70 ms 1656 KB Output is correct
22 Correct 47 ms 1528 KB Output is correct
23 Correct 131 ms 1716 KB Output is correct
24 Correct 47 ms 1528 KB Output is correct
25 Correct 135 ms 1836 KB Output is correct
26 Correct 135 ms 1788 KB Output is correct
27 Correct 108 ms 1784 KB Output is correct
28 Correct 143 ms 1692 KB Output is correct
29 Correct 110 ms 1696 KB Output is correct
30 Correct 115 ms 1784 KB Output is correct
31 Correct 122 ms 1712 KB Output is correct
32 Correct 111 ms 1912 KB Output is correct
33 Correct 123 ms 1784 KB Output is correct
34 Correct 128 ms 1700 KB Output is correct
35 Correct 30 ms 1656 KB Output is correct
36 Correct 26 ms 1656 KB Output is correct
37 Correct 29 ms 1528 KB Output is correct
38 Correct 8 ms 1528 KB Output is correct
39 Correct 8 ms 1532 KB Output is correct
40 Correct 140 ms 1976 KB Output is correct
41 Correct 8 ms 1528 KB Output is correct
42 Correct 141 ms 1656 KB Output is correct
43 Correct 140 ms 1656 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 3 ms 1656 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Execution timed out 3086 ms 5492 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 122 ms 1784 KB Output is correct
4 Correct 50 ms 1660 KB Output is correct
5 Correct 50 ms 1656 KB Output is correct
6 Correct 53 ms 1656 KB Output is correct
7 Correct 55 ms 1912 KB Output is correct
8 Correct 46 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 45 ms 1528 KB Output is correct
11 Correct 51 ms 1716 KB Output is correct
12 Correct 52 ms 1656 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 50 ms 1656 KB Output is correct
15 Correct 1 ms 1528 KB Output is correct
16 Correct 55 ms 1804 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 57 ms 1656 KB Output is correct
19 Correct 47 ms 1528 KB Output is correct
20 Correct 71 ms 1692 KB Output is correct
21 Correct 70 ms 1656 KB Output is correct
22 Correct 47 ms 1528 KB Output is correct
23 Correct 131 ms 1716 KB Output is correct
24 Correct 47 ms 1528 KB Output is correct
25 Correct 135 ms 1836 KB Output is correct
26 Correct 135 ms 1788 KB Output is correct
27 Correct 108 ms 1784 KB Output is correct
28 Correct 143 ms 1692 KB Output is correct
29 Correct 110 ms 1696 KB Output is correct
30 Correct 115 ms 1784 KB Output is correct
31 Correct 122 ms 1712 KB Output is correct
32 Correct 111 ms 1912 KB Output is correct
33 Correct 123 ms 1784 KB Output is correct
34 Correct 128 ms 1700 KB Output is correct
35 Correct 30 ms 1656 KB Output is correct
36 Correct 26 ms 1656 KB Output is correct
37 Correct 29 ms 1528 KB Output is correct
38 Correct 8 ms 1528 KB Output is correct
39 Correct 8 ms 1532 KB Output is correct
40 Correct 140 ms 1976 KB Output is correct
41 Correct 8 ms 1528 KB Output is correct
42 Correct 141 ms 1656 KB Output is correct
43 Correct 140 ms 1656 KB Output is correct
44 Correct 189 ms 1816 KB Output is correct
45 Correct 3 ms 1528 KB Output is correct
46 Correct 134 ms 1656 KB Output is correct
47 Correct 142 ms 1912 KB Output is correct
48 Correct 135 ms 1768 KB Output is correct
49 Correct 145 ms 1784 KB Output is correct
50 Correct 139 ms 1656 KB Output is correct
51 Correct 615 ms 2192 KB Output is correct
52 Correct 50 ms 1656 KB Output is correct
53 Execution timed out 3007 ms 2040 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 122 ms 1784 KB Output is correct
4 Correct 50 ms 1660 KB Output is correct
5 Correct 50 ms 1656 KB Output is correct
6 Correct 53 ms 1656 KB Output is correct
7 Correct 55 ms 1912 KB Output is correct
8 Correct 46 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 45 ms 1528 KB Output is correct
11 Correct 51 ms 1716 KB Output is correct
12 Correct 52 ms 1656 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 50 ms 1656 KB Output is correct
15 Correct 1 ms 1528 KB Output is correct
16 Correct 55 ms 1804 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 57 ms 1656 KB Output is correct
19 Correct 47 ms 1528 KB Output is correct
20 Correct 71 ms 1692 KB Output is correct
21 Correct 70 ms 1656 KB Output is correct
22 Correct 47 ms 1528 KB Output is correct
23 Correct 131 ms 1716 KB Output is correct
24 Correct 47 ms 1528 KB Output is correct
25 Correct 135 ms 1836 KB Output is correct
26 Correct 135 ms 1788 KB Output is correct
27 Correct 108 ms 1784 KB Output is correct
28 Correct 143 ms 1692 KB Output is correct
29 Correct 110 ms 1696 KB Output is correct
30 Correct 115 ms 1784 KB Output is correct
31 Correct 122 ms 1712 KB Output is correct
32 Correct 111 ms 1912 KB Output is correct
33 Correct 123 ms 1784 KB Output is correct
34 Correct 128 ms 1700 KB Output is correct
35 Correct 30 ms 1656 KB Output is correct
36 Correct 26 ms 1656 KB Output is correct
37 Correct 29 ms 1528 KB Output is correct
38 Correct 8 ms 1528 KB Output is correct
39 Correct 8 ms 1532 KB Output is correct
40 Correct 140 ms 1976 KB Output is correct
41 Correct 8 ms 1528 KB Output is correct
42 Correct 141 ms 1656 KB Output is correct
43 Correct 140 ms 1656 KB Output is correct
44 Correct 3 ms 1528 KB Output is correct
45 Execution timed out 3080 ms 3940 KB Time limit exceeded
46 Halted 0 ms 0 KB -