oj.uz

Submission #197169

# Submission time Handle Problem Language Result Execution time Memory
197169 2020-01-19T13:13:48 Z arnold518 Political Development (BOI17_politicaldevelopment) C++14
4 / 100
 123 ms 5112 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];
vector<int> adj2[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(auto it : chd) for(auto jt : chd) if(binary_search(adj[it].begin(), adj[it].end(), jt)) adj2[it].push_back(jt);

		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<adj2[V[j]].size() && adj2[V[j]][p]<V[k]; p++);
					if(adj2[V[j]][p]!=V[k]) flag=false;
				}
			}
			if(flag) ans=max(ans, (int)V.size()+1); 
		}
		vis[now]=true;
		for(auto it : chd) adj2[it].clear();
		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:42: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:44:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0; j<V.size(); j++)
             ~^~~~~~~~~
politicaldevelopment.cpp:46:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(k=j+1, p=0; k<V.size(); k++)
                     ~^~~~~~~~~
politicaldevelopment.cpp:48:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(; p<adj2[V[j]].size() && adj2[V[j]][p]<V[k]; p++);
            ~^~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:18: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:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
   ~~~~~^~~~~~~~~~
politicaldevelopment.cpp:23: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 4 ms 2684 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 123 ms 2936 KB Output is correct
4 Correct 52 ms 2936 KB Output is correct
5 Correct 52 ms 3076 KB Output is correct
6 Correct 58 ms 2936 KB Output is correct
7 Correct 58 ms 3064 KB Output is correct
8 Correct 48 ms 2724 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 48 ms 2712 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2684 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 123 ms 2936 KB Output is correct
4 Correct 52 ms 2936 KB Output is correct
5 Correct 52 ms 3076 KB Output is correct
6 Correct 58 ms 2936 KB Output is correct
7 Correct 58 ms 3064 KB Output is correct
8 Correct 48 ms 2724 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 48 ms 2712 KB Output is correct
11 Correct 52 ms 2936 KB Output is correct
12 Correct 52 ms 2852 KB Output is correct
13 Runtime error 8 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2720 KB Output is correct
2 Runtime error 11 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2684 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 123 ms 2936 KB Output is correct
4 Correct 52 ms 2936 KB Output is correct
5 Correct 52 ms 3076 KB Output is correct
6 Correct 58 ms 2936 KB Output is correct
7 Correct 58 ms 3064 KB Output is correct
8 Correct 48 ms 2724 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 48 ms 2712 KB Output is correct
11 Correct 52 ms 2936 KB Output is correct
12 Correct 52 ms 2852 KB Output is correct
13 Runtime error 8 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2684 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 123 ms 2936 KB Output is correct
4 Correct 52 ms 2936 KB Output is correct
5 Correct 52 ms 3076 KB Output is correct
6 Correct 58 ms 2936 KB Output is correct
7 Correct 58 ms 3064 KB Output is correct
8 Correct 48 ms 2724 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 48 ms 2712 KB Output is correct
11 Correct 52 ms 2936 KB Output is correct
12 Correct 52 ms 2852 KB Output is correct
13 Runtime error 8 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -