oj.uz

Submission #336584

# Submission time Handle Problem Language Result Execution time Memory
336584 2020-12-15T20:50:37 Z VROOM_VARUN Political Development (BOI17_politicaldevelopment) C++14
100 / 100
 1394 ms 27116 KB 
/*
ID: varunra2
LANG: C++
TASK: politicaldevelopment
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int n, k;
vector<SETI> adj;
VI deg;
vector<bool> use;
int mx = 0;

void init() {
  adj.resize(n);
  deg.assign(n, 0);
  use.assign(n, false);
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("politicaldevelopment.in", "r", stdin);
  // freopen("politicaldevelopment.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;

  init();

  for (int i = 0; i < n; i++) {
    int d;
    cin >> d;
    for (int j = 0; j < d; j++) {
      int u;
      cin >> u;
      adj[i].insert(u);
      adj[u].insert(i);
    }
  }

  rep(u, 0, n) trav(v, adj[u]) { deg[u]++; }

  queue<int> q;

  for (int i = 0; i < n; i++) {
    if (deg[i] <= k) q.push(i);
  }

  // debug(deg);
  // debug(q);

  while (!q.empty()) {
    // debug("debugging adj :imp:");
    // trav(x, adj) debug(x);
    int u = q.front();
    q.pop();
    VI cur;
    trav(x, adj[u]) if (!use[x]) cur.PB(x);
    for (int i = 0; i < (1 << sz(cur)); i++) {
      int val = __builtin_popcount(i);
      if (val < mx) continue;
      VI now;
      now.PB(u);
      for (int j = 0; j < sz(cur); j++) {
        if (i & (1 << j)) now.PB(cur[j]);
      }
      bool ok = true;
      for (int j = 0; j < sz(now) and ok; j++) {
        for (int kk = j + 1; kk < sz(now) and ok; kk++) {
          if (adj[now[j]].find(now[kk]) == adj[now[j]].end()) ok = false;
        }
      }
      // debug(cur)
      if (ok) mx = max(mx, val + 1);
    }
    use[u] = true;
    for (auto& x : cur) {
      adj[x].erase(u), deg[x]--;
      if (deg[x] <= k) q.push(x);
      adj[u].erase(x);
    }
  }

  cout << mx << '\n';

  return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:90:21: warning: unused variable 'v' [-Wunused-variable]
   90 |   rep(u, 0, n) trav(v, adj[u]) { deg[u]++; }
      |                     ^
politicaldevelopment.cpp:48:31: note: in definition of macro 'trav'
   48 | #define trav(a, x) for (auto& a : x)
      |                               ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 4 ms 1132 KB Output is correct
4 Correct 5 ms 1132 KB Output is correct
5 Correct 5 ms 1132 KB Output is correct
6 Correct 4 ms 1132 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 4 ms 1132 KB Output is correct
4 Correct 5 ms 1132 KB Output is correct
5 Correct 5 ms 1132 KB Output is correct
6 Correct 4 ms 1132 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct
12 Correct 6 ms 1260 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 5 ms 1132 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 4 ms 1132 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 5 ms 1132 KB Output is correct
19 Correct 1 ms 620 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 5 ms 1260 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 5 ms 1260 KB Output is correct
26 Correct 5 ms 1260 KB Output is correct
27 Correct 5 ms 1132 KB Output is correct
28 Correct 5 ms 1260 KB Output is correct
29 Correct 4 ms 1132 KB Output is correct
30 Correct 8 ms 1388 KB Output is correct
31 Correct 6 ms 1260 KB Output is correct
32 Correct 6 ms 1260 KB Output is correct
33 Correct 6 ms 1260 KB Output is correct
34 Correct 7 ms 1260 KB Output is correct
35 Correct 3 ms 876 KB Output is correct
36 Correct 3 ms 876 KB Output is correct
37 Correct 3 ms 876 KB Output is correct
38 Correct 2 ms 620 KB Output is correct
39 Correct 2 ms 620 KB Output is correct
40 Correct 8 ms 1644 KB Output is correct
41 Correct 2 ms 620 KB Output is correct
42 Correct 8 ms 1644 KB Output is correct
43 Correct 8 ms 1644 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1394 ms 27116 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 504 ms 27116 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1352 ms 26988 KB Output is correct
16 Correct 534 ms 26988 KB Output is correct
17 Correct 919 ms 26988 KB Output is correct
18 Correct 1084 ms 26988 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 4 ms 1132 KB Output is correct
4 Correct 5 ms 1132 KB Output is correct
5 Correct 5 ms 1132 KB Output is correct
6 Correct 4 ms 1132 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct
12 Correct 6 ms 1260 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 5 ms 1132 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 4 ms 1132 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 5 ms 1132 KB Output is correct
19 Correct 1 ms 620 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 5 ms 1260 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 5 ms 1260 KB Output is correct
26 Correct 5 ms 1260 KB Output is correct
27 Correct 5 ms 1132 KB Output is correct
28 Correct 5 ms 1260 KB Output is correct
29 Correct 4 ms 1132 KB Output is correct
30 Correct 8 ms 1388 KB Output is correct
31 Correct 6 ms 1260 KB Output is correct
32 Correct 6 ms 1260 KB Output is correct
33 Correct 6 ms 1260 KB Output is correct
34 Correct 7 ms 1260 KB Output is correct
35 Correct 3 ms 876 KB Output is correct
36 Correct 3 ms 876 KB Output is correct
37 Correct 3 ms 876 KB Output is correct
38 Correct 2 ms 620 KB Output is correct
39 Correct 2 ms 620 KB Output is correct
40 Correct 8 ms 1644 KB Output is correct
41 Correct 2 ms 620 KB Output is correct
42 Correct 8 ms 1644 KB Output is correct
43 Correct 8 ms 1644 KB Output is correct
44 Correct 16 ms 2668 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 9 ms 1644 KB Output is correct
47 Correct 27 ms 2668 KB Output is correct
48 Correct 8 ms 1644 KB Output is correct
49 Correct 27 ms 2668 KB Output is correct
50 Correct 41 ms 2668 KB Output is correct
51 Correct 330 ms 4716 KB Output is correct
52 Correct 5 ms 1132 KB Output is correct
53 Correct 644 ms 5228 KB Output is correct
54 Correct 717 ms 5228 KB Output is correct
55 Correct 4 ms 1132 KB Output is correct
56 Correct 5 ms 1132 KB Output is correct
57 Correct 1 ms 620 KB Output is correct
58 Correct 663 ms 5228 KB Output is correct
59 Correct 7 ms 1644 KB Output is correct
60 Correct 4 ms 1132 KB Output is correct
61 Correct 7 ms 1644 KB Output is correct
62 Correct 10 ms 1644 KB Output is correct
63 Correct 15 ms 2668 KB Output is correct
64 Correct 13 ms 2412 KB Output is correct
65 Correct 7 ms 1516 KB Output is correct
66 Correct 7 ms 1644 KB Output is correct
67 Correct 30 ms 3052 KB Output is correct
68 Correct 13 ms 2412 KB Output is correct
69 Correct 9 ms 1516 KB Output is correct
70 Correct 18 ms 2412 KB Output is correct
71 Correct 24 ms 3052 KB Output is correct
72 Correct 26 ms 3052 KB Output is correct
73 Correct 4 ms 1132 KB Output is correct
74 Correct 18 ms 2540 KB Output is correct
75 Correct 23 ms 3052 KB Output is correct
76 Correct 17 ms 2028 KB Output is correct
77 Correct 249 ms 3584 KB Output is correct
78 Correct 6 ms 1280 KB Output is correct
79 Correct 122 ms 1900 KB Output is correct
80 Correct 18 ms 2028 KB Output is correct
81 Correct 248 ms 3564 KB Output is correct
82 Correct 2 ms 620 KB Output is correct
83 Correct 127 ms 2028 KB Output is correct
84 Correct 98 ms 2924 KB Output is correct
85 Correct 3 ms 620 KB Output is correct
86 Correct 31 ms 2924 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 4 ms 1132 KB Output is correct
4 Correct 5 ms 1132 KB Output is correct
5 Correct 5 ms 1132 KB Output is correct
6 Correct 4 ms 1132 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct
12 Correct 6 ms 1260 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 5 ms 1132 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 4 ms 1132 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 5 ms 1132 KB Output is correct
19 Correct 1 ms 620 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 5 ms 1260 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 5 ms 1260 KB Output is correct
26 Correct 5 ms 1260 KB Output is correct
27 Correct 5 ms 1132 KB Output is correct
28 Correct 5 ms 1260 KB Output is correct
29 Correct 4 ms 1132 KB Output is correct
30 Correct 8 ms 1388 KB Output is correct
31 Correct 6 ms 1260 KB Output is correct
32 Correct 6 ms 1260 KB Output is correct
33 Correct 6 ms 1260 KB Output is correct
34 Correct 7 ms 1260 KB Output is correct
35 Correct 3 ms 876 KB Output is correct
36 Correct 3 ms 876 KB Output is correct
37 Correct 3 ms 876 KB Output is correct
38 Correct 2 ms 620 KB Output is correct
39 Correct 2 ms 620 KB Output is correct
40 Correct 8 ms 1644 KB Output is correct
41 Correct 2 ms 620 KB Output is correct
42 Correct 8 ms 1644 KB Output is correct
43 Correct 8 ms 1644 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 261 ms 18924 KB Output is correct
46 Correct 85 ms 11116 KB Output is correct
47 Correct 294 ms 19052 KB Output is correct
48 Correct 256 ms 18924 KB Output is correct
49 Correct 62 ms 8428 KB Output is correct
50 Correct 402 ms 24236 KB Output is correct
51 Correct 286 ms 18924 KB Output is correct
52 Correct 55 ms 8428 KB Output is correct
53 Correct 59 ms 8428 KB Output is correct
54 Correct 6 ms 3180 KB Output is correct
55 Correct 394 ms 24300 KB Output is correct
56 Correct 21 ms 5868 KB Output is correct
57 Correct 55 ms 8556 KB Output is correct
58 Correct 70 ms 11244 KB Output is correct
59 Correct 21 ms 5868 KB Output is correct
60 Correct 21 ms 5868 KB Output is correct
61 Correct 68 ms 11116 KB Output is correct
62 Correct 45 ms 8428 KB Output is correct
63 Correct 118 ms 12396 KB Output is correct
64 Correct 21 ms 5868 KB Output is correct
65 Correct 166 ms 15084 KB Output is correct
66 Correct 46 ms 8428 KB Output is correct
67 Correct 122 ms 12396 KB Output is correct
68 Correct 164 ms 14444 KB Output is correct
69 Correct 167 ms 15264 KB Output is correct
70 Correct 48 ms 8428 KB Output is correct
71 Correct 164 ms 14444 KB Output is correct
72 Correct 110 ms 12012 KB Output is correct
73 Correct 242 ms 16876 KB Output is correct
74 Correct 50 ms 8428 KB Output is correct
75 Correct 55 ms 6892 KB Output is correct
76 Correct 109 ms 12012 KB Output is correct
77 Correct 244 ms 16748 KB Output is correct
78 Correct 100 ms 8556 KB Output is correct
79 Correct 56 ms 6892 KB Output is correct
80 Correct 23 ms 3564 KB Output is correct
81 Correct 99 ms 8556 KB Output is correct
82 Correct 129 ms 13676 KB Output is correct
83 Correct 23 ms 3564 KB Output is correct
84 Correct 136 ms 13676 KB Output is correct