oj.uz

답안 #128730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128730 2019-07-11T08:43:29 Z davitmarg Political Development (BOI17_politicaldevelopment) C++17
54 / 100
 3000 ms 195072 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;
 
int n,k,used[50004],ans=1;
vector<int> g[50004];
map<pair<int,int>,bool> edge;
vector<pair<int,int>> p;
vector<vector<int>> pol[15];
 
bool check(vector<int> a)
{
	map<int,bool> used;
    for(int i=0;i<a.size();i++)
        for(int j=i+1;j<a.size();j++)
            if(!edge[MP(i,j)] || !edge[MP(j,i)])
				return 0;
 
	return 1;
}
 
int main()
{
        srand(4864);
	cin>>n>>k;
    for(int i=0;i<n;i++)
	{
        int d,to;
        cin>>d;
        while(d--)
		{
            scanf("%d",&to);
            edge[MP(i,to)]=1;
            g[i].PB(to);
            if(i>to)
				p.PB(MP(i,to));
		}
	}
 
    for(int i=0;i<p.size();i++)
	{
        pol[2].PB(vector<int>(0));
        pol[2].back().PB(p[i].first);
        pol[2].back().PB(p[i].second);
        ans=2;
	}
    if(k!=5)
	{
		for(int t=3;t<=k;t++)
		{
			pol[t-2].clear();
			random_shuffle(all(pol[t-1]));
			for(int i=0;i<pol[t-1].size() && i<n;i++)
			{
				random_shuffle(all(pol[t-1][i]));
 
				for(int j=0;j<pol[t-1][i].size();j++)
					used[pol[t-1][i][j]]=1;
				for(int j=0;j<pol[t-1][i].size() && j<n;j++)
				{
					for(int x=0;x<g[pol[t-1][i].back()].size();x++)
					{
						int to=g[pol[t-1][i].back()][x];
						if(used[to])
							continue;
						bool f=1;
						for(int y=0;y<pol[t-1][i].size()-1;y++)
							if(edge.find(MP(pol[t-1][i][y],to))==edge.end())
							{
								f=0;
								break;
							}
						if(f)
						{
							ans=t;
							pol[t].PB(pol[t-1][i]);
							pol[t].back().PB(to);
						}
 
					}
				}
				for(int j=0;j<pol[t-1][i].size();j++)
					used[pol[t-1][i][j]]=0;
			}
		}
	}
	else
	{
		for(int t=3;t<=k;t++)
		{
			pol[t-2].clear();
			random_shuffle(all(pol[t-1]));
			for(int i=0;i<pol[t-1].size() && i<n;i++)
			{
				random_shuffle(all(pol[t-1][i]));
 
				for(int j=0;j<pol[t-1][i].size();j++)
					used[pol[t-1][i][j]]=1;
				for(int j=0;j<pol[t-1][i].size() && j<n/10;j++)
				{
					for(int x=0;x<g[pol[t-1][i].back()].size();x++)
					{
						int to=g[pol[t-1][i].back()][x];
						if(used[to])
							continue;
						bool f=1;
						for(int y=0;y<pol[t-1][i].size()-1;y++)
							if(edge.find(MP(pol[t-1][i][y],to))==edge.end())
							{
								f=0;
								break;
							}
						if(f)
						{
							ans=t;
							pol[t].PB(pol[t-1][i]);
							pol[t].back().PB(to);
						}
 
					}
				}
				for(int j=0;j<pol[t-1][i].size();j++)
					used[pol[t-1][i][j]]=0;
			}
		}
 
	}
    cout<<ans<<endl;
	return 0;
}
 
 
/*
 
 
 
 
*/

Compilation message

politicaldevelopment.cpp: In function 'bool check(std::vector<int>)':
politicaldevelopment.cpp:34:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<a.size();i++)
                 ~^~~~~~~~~
politicaldevelopment.cpp:35:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=i+1;j<a.size();j++)
                       ~^~~~~~~~~
politicaldevelopment.cpp:34:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i=0;i<a.size();i++)
     ^~~
politicaldevelopment.cpp:39:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return 1;
  ^~~~~~
politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:60:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<p.size();i++)
                 ~^~~~~~~~~
politicaldevelopment.cpp:73:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0;i<pol[t-1].size() && i<n;i++)
                ~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:77:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size();j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:79:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size() && j<n;j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:81:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int x=0;x<g[pol[t-1][i].back()].size();x++)
                  ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:87:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int y=0;y<pol[t-1][i].size()-1;y++)
                   ~^~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:102:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size();j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:113:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0;i<pol[t-1].size() && i<n;i++)
                ~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:117:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size();j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:119:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size() && j<n/10;j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:121:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int x=0;x<g[pol[t-1][i].back()].size();x++)
                  ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:127:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int y=0;y<pol[t-1][i].size()-1;y++)
                   ~^~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:142:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<pol[t-1][i].size();j++)
                 ~^~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:52:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&to);
             ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 9 ms 2680 KB Output is correct
4 Correct 9 ms 2680 KB Output is correct
5 Correct 9 ms 2680 KB Output is correct
6 Correct 9 ms 2680 KB Output is correct
7 Correct 9 ms 2680 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 9 ms 2680 KB Output is correct
4 Correct 9 ms 2680 KB Output is correct
5 Correct 9 ms 2680 KB Output is correct
6 Correct 9 ms 2680 KB Output is correct
7 Correct 9 ms 2680 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 9 ms 2680 KB Output is correct
12 Correct 813 ms 2808 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 865 ms 2808 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 24 ms 2680 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 24 ms 2680 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 7 ms 2168 KB Output is correct
21 Correct 7 ms 2168 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 4 ms 1536 KB Output is correct
25 Correct 15 ms 2976 KB Output is correct
26 Correct 14 ms 2808 KB Output is correct
27 Correct 12 ms 2684 KB Output is correct
28 Correct 13 ms 2808 KB Output is correct
29 Correct 12 ms 2680 KB Output is correct
30 Correct 164 ms 2936 KB Output is correct
31 Correct 14 ms 2940 KB Output is correct
32 Correct 170 ms 2936 KB Output is correct
33 Correct 14 ms 2936 KB Output is correct
34 Correct 14 ms 2936 KB Output is correct
35 Correct 8 ms 2168 KB Output is correct
36 Correct 8 ms 2168 KB Output is correct
37 Correct 9 ms 2268 KB Output is correct
38 Correct 9 ms 2040 KB Output is correct
39 Correct 8 ms 2040 KB Output is correct
40 Correct 20 ms 3704 KB Output is correct
41 Correct 9 ms 2040 KB Output is correct
42 Correct 20 ms 3704 KB Output is correct
43 Correct 20 ms 3704 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1576 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 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 4 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 434 ms 48140 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Execution timed out 3040 ms 195072 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 9 ms 2680 KB Output is correct
4 Correct 9 ms 2680 KB Output is correct
5 Correct 9 ms 2680 KB Output is correct
6 Correct 9 ms 2680 KB Output is correct
7 Correct 9 ms 2680 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 9 ms 2680 KB Output is correct
12 Correct 813 ms 2808 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 865 ms 2808 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 24 ms 2680 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 24 ms 2680 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 7 ms 2168 KB Output is correct
21 Correct 7 ms 2168 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 4 ms 1536 KB Output is correct
25 Correct 15 ms 2976 KB Output is correct
26 Correct 14 ms 2808 KB Output is correct
27 Correct 12 ms 2684 KB Output is correct
28 Correct 13 ms 2808 KB Output is correct
29 Correct 12 ms 2680 KB Output is correct
30 Correct 164 ms 2936 KB Output is correct
31 Correct 14 ms 2940 KB Output is correct
32 Correct 170 ms 2936 KB Output is correct
33 Correct 14 ms 2936 KB Output is correct
34 Correct 14 ms 2936 KB Output is correct
35 Correct 8 ms 2168 KB Output is correct
36 Correct 8 ms 2168 KB Output is correct
37 Correct 9 ms 2268 KB Output is correct
38 Correct 9 ms 2040 KB Output is correct
39 Correct 8 ms 2040 KB Output is correct
40 Correct 20 ms 3704 KB Output is correct
41 Correct 9 ms 2040 KB Output is correct
42 Correct 20 ms 3704 KB Output is correct
43 Correct 20 ms 3704 KB Output is correct
44 Correct 391 ms 29596 KB Output is correct
45 Correct 3 ms 1528 KB Output is correct
46 Correct 21 ms 3704 KB Output is correct
47 Correct 47 ms 5936 KB Output is correct
48 Correct 21 ms 3832 KB Output is correct
49 Correct 54 ms 5936 KB Output is correct
50 Correct 48 ms 5808 KB Output is correct
51 Correct 888 ms 25828 KB Output is correct
52 Correct 9 ms 2808 KB Output is correct
53 Correct 1310 ms 10852 KB Output is correct
54 Correct 1305 ms 32640 KB Output is correct
55 Correct 23 ms 2808 KB Output is correct
56 Correct 10 ms 2684 KB Output is correct
57 Correct 4 ms 1528 KB Output is correct
58 Correct 1336 ms 11152 KB Output is correct
59 Correct 57 ms 7476 KB Output is correct
60 Correct 24 ms 2808 KB Output is correct
61 Correct 56 ms 7472 KB Output is correct
62 Correct 63 ms 7600 KB Output is correct
63 Correct 398 ms 28704 KB Output is correct
64 Correct 261 ms 21156 KB Output is correct
65 Correct 23 ms 3576 KB Output is correct
66 Correct 60 ms 7600 KB Output is correct
67 Correct 490 ms 28320 KB Output is correct
68 Correct 268 ms 21156 KB Output is correct
69 Correct 21 ms 3576 KB Output is correct
70 Correct 160 ms 11256 KB Output is correct
71 Correct 471 ms 28216 KB Output is correct
72 Correct 342 ms 21020 KB Output is correct
73 Correct 12 ms 2680 KB Output is correct
74 Correct 138 ms 11348 KB Output is correct
75 Correct 348 ms 20972 KB Output is correct
76 Correct 116 ms 4532 KB Output is correct
77 Correct 49 ms 7596 KB Output is correct
78 Correct 12 ms 2784 KB Output is correct
79 Correct 24 ms 4532 KB Output is correct
80 Correct 115 ms 4448 KB Output is correct
81 Correct 48 ms 7536 KB Output is correct
82 Correct 8 ms 2040 KB Output is correct
83 Correct 25 ms 4532 KB Output is correct
84 Correct 162 ms 17296 KB Output is correct
85 Correct 8 ms 2040 KB Output is correct
86 Correct 158 ms 17160 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 9 ms 2680 KB Output is correct
4 Correct 9 ms 2680 KB Output is correct
5 Correct 9 ms 2680 KB Output is correct
6 Correct 9 ms 2680 KB Output is correct
7 Correct 9 ms 2680 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 9 ms 2680 KB Output is correct
12 Correct 813 ms 2808 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 865 ms 2808 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 24 ms 2680 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 24 ms 2680 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 7 ms 2168 KB Output is correct
21 Correct 7 ms 2168 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 4 ms 1536 KB Output is correct
25 Correct 15 ms 2976 KB Output is correct
26 Correct 14 ms 2808 KB Output is correct
27 Correct 12 ms 2684 KB Output is correct
28 Correct 13 ms 2808 KB Output is correct
29 Correct 12 ms 2680 KB Output is correct
30 Correct 164 ms 2936 KB Output is correct
31 Correct 14 ms 2940 KB Output is correct
32 Correct 170 ms 2936 KB Output is correct
33 Correct 14 ms 2936 KB Output is correct
34 Correct 14 ms 2936 KB Output is correct
35 Correct 8 ms 2168 KB Output is correct
36 Correct 8 ms 2168 KB Output is correct
37 Correct 9 ms 2268 KB Output is correct
38 Correct 9 ms 2040 KB Output is correct
39 Correct 8 ms 2040 KB Output is correct
40 Correct 20 ms 3704 KB Output is correct
41 Correct 9 ms 2040 KB Output is correct
42 Correct 20 ms 3704 KB Output is correct
43 Correct 20 ms 3704 KB Output is correct
44 Correct 3 ms 1528 KB Output is correct
45 Correct 336 ms 34212 KB Output is correct
46 Execution timed out 3033 ms 18408 KB Time limit exceeded
47 Halted 0 ms 0 KB -