oj.uz

답안 #472569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472569 2021-09-13T18:07:53 Z ZaZo_ Political Development (BOI17_politicaldevelopment) C++14
16 / 100
 335 ms 2252 KB 
#include <bits/stdc++.h>
#define ZAZO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
vector<int>edges[50001];
int vis[50001]={0};
int mx=1,n,k;
int32_t main() {
  ZAZO
  cin >> n >> k ;
  for(int i = 0 ; i < n ; i ++)
  {
    int d;
    cin>>d;
    for(int j = 0 ; j < d ; j ++)
    {
      mx=2;
      int x; cin>>x;
      edges[i].push_back(x);
      edges[x].push_back(i);
    }
  }
  for(int i = 0 ; i < n ; i ++)
  {
    for(int j = 0 ; j < edges[i].size() ; j ++)
    {
      for(int p = j+1 ; p < edges[i].size(); p++)
      {
        int flg=0;
        int p1 = edges[i][j] , p2 = edges[i][p];
        auto it = find(edges[p1].begin(),edges[p1].end(),p2);
        if(it!=edges[p1].end())
        {
          mx=max(mx,3ll);
          flg=1;
        }
        if(!flg||mx>=k) continue;
        for(int k = j+2 ; k < edges[i].size(); k++)
        {
          int flg1=0,p3 = edges[i][k] , p4 = edges[i][p];
          auto it2 = find(edges[p3].begin(),edges[p3].end(),p4);
          if(it2!=edges[p3].end())
          {
            mx=max(mx,4ll);
            flg1=1;
          }
          if(!flg1||mx>=k) continue;
          for(int kk = j+3 ; kk<edges[i].size() ; kk++)
          {
            int flg2=0,p5 = edges[i][kk] , p6 = edges[i][k];
            auto it3 = find(edges[p5].begin(),edges[p5].end(),p6);
            if(it3!=edges[p5].end())
            {
              mx=max(mx,5ll);
              cout<<"5"<<endl;
              return 0;
            }
          }
        }
      }
    }
  }
  cout<<mx<<endl;
}

Compilation message

politicaldevelopment.cpp: In function 'int32_t main()':
politicaldevelopment.cpp:25:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int j = 0 ; j < edges[i].size() ; j ++)
      |                     ~~^~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:27:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |       for(int p = j+1 ; p < edges[i].size(); p++)
      |                         ~~^~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:38:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int k = j+2 ; k < edges[i].size(); k++)
      |                           ~~^~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:48:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |           for(int kk = j+3 ; kk<edges[i].size() ; kk++)
      |                              ~~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:50:17: warning: unused variable 'flg2' [-Wunused-variable]
   50 |             int flg2=0,p5 = edges[i][kk] , p6 = edges[i][k];
      |                 ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 5 ms 1740 KB Output is correct
4 Correct 328 ms 1784 KB Output is correct
5 Correct 321 ms 1784 KB Output is correct
6 Correct 10 ms 1740 KB Output is correct
7 Correct 11 ms 1848 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 5 ms 1740 KB Output is correct
4 Correct 328 ms 1784 KB Output is correct
5 Correct 321 ms 1784 KB Output is correct
6 Correct 10 ms 1740 KB Output is correct
7 Correct 11 ms 1848 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 323 ms 1788 KB Output is correct
12 Correct 335 ms 1788 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 319 ms 1788 KB Output is correct
15 Correct 2 ms 1484 KB Output is correct
16 Correct 9 ms 1740 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 9 ms 1740 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 4 ms 1604 KB Output is correct
21 Correct 3 ms 1612 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 5 ms 1740 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 5 ms 1740 KB Output is correct
26 Correct 5 ms 1740 KB Output is correct
27 Correct 4 ms 1740 KB Output is correct
28 Correct 5 ms 1740 KB Output is correct
29 Correct 4 ms 1740 KB Output is correct
30 Correct 88 ms 1832 KB Output is correct
31 Correct 5 ms 1740 KB Output is correct
32 Correct 91 ms 1836 KB Output is correct
33 Correct 5 ms 1740 KB Output is correct
34 Correct 6 ms 1740 KB Output is correct
35 Correct 3 ms 1612 KB Output is correct
36 Correct 3 ms 1612 KB Output is correct
37 Correct 4 ms 1612 KB Output is correct
38 Correct 5 ms 1612 KB Output is correct
39 Correct 4 ms 1612 KB Output is correct
40 Correct 9 ms 1996 KB Output is correct
41 Correct 4 ms 1612 KB Output is correct
42 Correct 9 ms 1928 KB Output is correct
43 Correct 9 ms 1996 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Incorrect 1 ms 1484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 5 ms 1740 KB Output is correct
4 Correct 328 ms 1784 KB Output is correct
5 Correct 321 ms 1784 KB Output is correct
6 Correct 10 ms 1740 KB Output is correct
7 Correct 11 ms 1848 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 323 ms 1788 KB Output is correct
12 Correct 335 ms 1788 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 319 ms 1788 KB Output is correct
15 Correct 2 ms 1484 KB Output is correct
16 Correct 9 ms 1740 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 9 ms 1740 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 4 ms 1604 KB Output is correct
21 Correct 3 ms 1612 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 5 ms 1740 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 5 ms 1740 KB Output is correct
26 Correct 5 ms 1740 KB Output is correct
27 Correct 4 ms 1740 KB Output is correct
28 Correct 5 ms 1740 KB Output is correct
29 Correct 4 ms 1740 KB Output is correct
30 Correct 88 ms 1832 KB Output is correct
31 Correct 5 ms 1740 KB Output is correct
32 Correct 91 ms 1836 KB Output is correct
33 Correct 5 ms 1740 KB Output is correct
34 Correct 6 ms 1740 KB Output is correct
35 Correct 3 ms 1612 KB Output is correct
36 Correct 3 ms 1612 KB Output is correct
37 Correct 4 ms 1612 KB Output is correct
38 Correct 5 ms 1612 KB Output is correct
39 Correct 4 ms 1612 KB Output is correct
40 Correct 9 ms 1996 KB Output is correct
41 Correct 4 ms 1612 KB Output is correct
42 Correct 9 ms 1928 KB Output is correct
43 Correct 9 ms 1996 KB Output is correct
44 Incorrect 8 ms 2252 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 5 ms 1740 KB Output is correct
4 Correct 328 ms 1784 KB Output is correct
5 Correct 321 ms 1784 KB Output is correct
6 Correct 10 ms 1740 KB Output is correct
7 Correct 11 ms 1848 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 323 ms 1788 KB Output is correct
12 Correct 335 ms 1788 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 319 ms 1788 KB Output is correct
15 Correct 2 ms 1484 KB Output is correct
16 Correct 9 ms 1740 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 9 ms 1740 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 4 ms 1604 KB Output is correct
21 Correct 3 ms 1612 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 5 ms 1740 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 5 ms 1740 KB Output is correct
26 Correct 5 ms 1740 KB Output is correct
27 Correct 4 ms 1740 KB Output is correct
28 Correct 5 ms 1740 KB Output is correct
29 Correct 4 ms 1740 KB Output is correct
30 Correct 88 ms 1832 KB Output is correct
31 Correct 5 ms 1740 KB Output is correct
32 Correct 91 ms 1836 KB Output is correct
33 Correct 5 ms 1740 KB Output is correct
34 Correct 6 ms 1740 KB Output is correct
35 Correct 3 ms 1612 KB Output is correct
36 Correct 3 ms 1612 KB Output is correct
37 Correct 4 ms 1612 KB Output is correct
38 Correct 5 ms 1612 KB Output is correct
39 Correct 4 ms 1612 KB Output is correct
40 Correct 9 ms 1996 KB Output is correct
41 Correct 4 ms 1612 KB Output is correct
42 Correct 9 ms 1928 KB Output is correct
43 Correct 9 ms 1996 KB Output is correct
44 Incorrect 1 ms 1484 KB Output isn't correct
45 Halted 0 ms 0 KB -