oj.uz

Submission #1035475

# Submission time Handle Problem Language Result Execution time Memory
1035475 2024-07-26T11:27:06 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
77 / 100
 2186 ms 338304 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()

const int N = 5e4, X = 5e2, X2 = 5e1;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, c, ans;
vector<int> vt, adj[N];
set<int> st[N];
bitset<N> bt2[N], r, taken, toTake;

void clean(int x) {
  for (int i = 0; i < n; i++) {
    if (adj[i].size()+1 < x) r[i] = 1;
  }
}

void dfs2(int x) {
  if (c++ > X2) return;

  int sz = taken.count();
  if (sz > ans) {
    ans = sz;
    clean(sz+1);
  }

  shuffle(all(adj[x]), rng);
  for (int& y : adj[x]) { 
    if (c++ > X2) return;
    if (r[y] || taken[y] || (taken & bt2[y]).count() < sz) continue;

    taken[y] = 1;
    bitset<N> toTakePrev = toTake;
    toTake &= bt2[y];

    dfs2(y);
    if (c++ > X2) return;

    toTake = toTakePrev;
    taken[y] = 0;
  }
}

void dfs(int x) {
  if (c++ > X) return;

  int sz = taken.count();
  if (sz > ans) {
    ans = sz;
    clean(sz+1);
  }

  shuffle(all(adj[x]), rng);
  for (int& y : adj[x]) { 
    if (c++ > X) return;
    if (r[y] || taken[y] || (taken & bt2[y]).count() < sz) continue;

    taken[y] = 1;
    bitset<N> toTakePrev = toTake;
    toTake &= bt2[y];

    dfs(y);
    if (c++ > X) return;

    toTake = toTakePrev;
    taken[y] = 0;
  }
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n >> k;
  ans = 1;
  vt.resize(n);
  for (int i = 0; i < n; i++) {
    vt[i] = i;
    bt2[i][i] = toTake[i] = 1;

    int x; cin >> x;
    for (int j = 0; j < x; j++) {
      int y; cin >> y;
      st[i].insert(y);

      if (st[y].find(i) != st[y].end()) {
        bt2[i][y] = 1;
        adj[i].push_back(y);

        bt2[y][i] = 1;
        adj[y].push_back(i);
      }
    }
  }

  for (int i = 0; i < n; i++) {
    if (r[i]) continue;

    c = 0;

    taken.reset();
    taken[i] = 1;
    toTake = bt2[i];

    if (n <= 5000) dfs(i);
    else dfs2(i);
  }

  cout << ans << "\n";
}

Compilation message

politicaldevelopment.cpp: In function 'void clean(int)':
politicaldevelopment.cpp:19:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     if (adj[i].size()+1 < x) r[i] = 1;
      |         ~~~~~~~~~~~~~~~~^~~
politicaldevelopment.cpp: In function 'void dfs2(int)':
politicaldevelopment.cpp:35:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if (r[y] || taken[y] || (taken & bt2[y]).count() < sz) continue;
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
politicaldevelopment.cpp: In function 'void dfs(int)':
politicaldevelopment.cpp:61:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   61 |     if (r[y] || taken[y] || (taken & bt2[y]).count() < sz) continue;
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26200 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 11 ms 25552 KB Output is correct
6 Correct 14 ms 25776 KB Output is correct
7 Correct 18 ms 25892 KB Output is correct
8 Correct 14 ms 23888 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24008 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26200 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 11 ms 25552 KB Output is correct
6 Correct 14 ms 25776 KB Output is correct
7 Correct 18 ms 25892 KB Output is correct
8 Correct 14 ms 23888 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24008 KB Output is correct
11 Correct 12 ms 25692 KB Output is correct
12 Correct 13 ms 25456 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 13 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25876 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 15 ms 25724 KB Output is correct
19 Correct 13 ms 23900 KB Output is correct
20 Correct 10 ms 25436 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23972 KB Output is correct
23 Correct 27 ms 26516 KB Output is correct
24 Correct 9 ms 23900 KB Output is correct
25 Correct 29 ms 26536 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 33 ms 26308 KB Output is correct
28 Correct 34 ms 26228 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 388 ms 26204 KB Output is correct
31 Correct 52 ms 26456 KB Output is correct
32 Correct 461 ms 26460 KB Output is correct
33 Correct 55 ms 26456 KB Output is correct
34 Correct 46 ms 26460 KB Output is correct
35 Correct 23 ms 14872 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 24 ms 14928 KB Output is correct
38 Correct 58 ms 9304 KB Output is correct
39 Correct 51 ms 9304 KB Output is correct
40 Correct 74 ms 27228 KB Output is correct
41 Correct 51 ms 9304 KB Output is correct
42 Correct 65 ms 27224 KB Output is correct
43 Correct 63 ms 27204 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23900 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3928 KB Output is correct
5 Correct 3 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3932 KB Output is correct
11 Correct 2122 ms 337744 KB Output is correct
12 Correct 3 ms 3928 KB Output is correct
13 Correct 2186 ms 338304 KB Output is correct
14 Correct 3 ms 3940 KB Output is correct
15 Correct 2162 ms 338244 KB Output is correct
16 Correct 2060 ms 338100 KB Output is correct
17 Correct 2060 ms 338256 KB Output is correct
18 Correct 2057 ms 338260 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26200 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 11 ms 25552 KB Output is correct
6 Correct 14 ms 25776 KB Output is correct
7 Correct 18 ms 25892 KB Output is correct
8 Correct 14 ms 23888 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24008 KB Output is correct
11 Correct 12 ms 25692 KB Output is correct
12 Correct 13 ms 25456 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 13 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25876 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 15 ms 25724 KB Output is correct
19 Correct 13 ms 23900 KB Output is correct
20 Correct 10 ms 25436 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23972 KB Output is correct
23 Correct 27 ms 26516 KB Output is correct
24 Correct 9 ms 23900 KB Output is correct
25 Correct 29 ms 26536 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 33 ms 26308 KB Output is correct
28 Correct 34 ms 26228 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 388 ms 26204 KB Output is correct
31 Correct 52 ms 26456 KB Output is correct
32 Correct 461 ms 26460 KB Output is correct
33 Correct 55 ms 26456 KB Output is correct
34 Correct 46 ms 26460 KB Output is correct
35 Correct 23 ms 14872 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 24 ms 14928 KB Output is correct
38 Correct 58 ms 9304 KB Output is correct
39 Correct 51 ms 9304 KB Output is correct
40 Correct 74 ms 27228 KB Output is correct
41 Correct 51 ms 9304 KB Output is correct
42 Correct 65 ms 27224 KB Output is correct
43 Correct 63 ms 27204 KB Output is correct
44 Correct 16 ms 28764 KB Output is correct
45 Correct 3 ms 4160 KB Output is correct
46 Correct 49 ms 26968 KB Output is correct
47 Correct 203 ms 28760 KB Output is correct
48 Correct 64 ms 27084 KB Output is correct
49 Correct 214 ms 28808 KB Output is correct
50 Correct 212 ms 28508 KB Output is correct
51 Correct 710 ms 31652 KB Output is correct
52 Correct 13 ms 25948 KB Output is correct
53 Correct 1569 ms 32056 KB Output is correct
54 Correct 813 ms 32088 KB Output is correct
55 Correct 15 ms 25692 KB Output is correct
56 Correct 12 ms 26204 KB Output is correct
57 Correct 14 ms 23900 KB Output is correct
58 Correct 1680 ms 31824 KB Output is correct
59 Correct 13 ms 27228 KB Output is correct
60 Correct 14 ms 25692 KB Output is correct
61 Correct 13 ms 27248 KB Output is correct
62 Correct 14 ms 27228 KB Output is correct
63 Correct 18 ms 28752 KB Output is correct
64 Correct 18 ms 28508 KB Output is correct
65 Correct 39 ms 26972 KB Output is correct
66 Correct 15 ms 27228 KB Output is correct
67 Correct 207 ms 29276 KB Output is correct
68 Correct 18 ms 28564 KB Output is correct
69 Correct 46 ms 26972 KB Output is correct
70 Correct 229 ms 28536 KB Output is correct
71 Correct 211 ms 29340 KB Output is correct
72 Correct 247 ms 29248 KB Output is correct
73 Correct 35 ms 26204 KB Output is correct
74 Correct 234 ms 28504 KB Output is correct
75 Correct 238 ms 29272 KB Output is correct
76 Correct 654 ms 27736 KB Output is correct
77 Correct 421 ms 29784 KB Output is correct
78 Correct 34 ms 26268 KB Output is correct
79 Correct 216 ms 16464 KB Output is correct
80 Correct 660 ms 27816 KB Output is correct
81 Correct 531 ms 30040 KB Output is correct
82 Correct 51 ms 9308 KB Output is correct
83 Correct 225 ms 16420 KB Output is correct
84 Correct 314 ms 29264 KB Output is correct
85 Correct 55 ms 9308 KB Output is correct
86 Correct 358 ms 29392 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26200 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 11 ms 25552 KB Output is correct
6 Correct 14 ms 25776 KB Output is correct
7 Correct 18 ms 25892 KB Output is correct
8 Correct 14 ms 23888 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24008 KB Output is correct
11 Correct 12 ms 25692 KB Output is correct
12 Correct 13 ms 25456 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 13 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25876 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 15 ms 25724 KB Output is correct
19 Correct 13 ms 23900 KB Output is correct
20 Correct 10 ms 25436 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23972 KB Output is correct
23 Correct 27 ms 26516 KB Output is correct
24 Correct 9 ms 23900 KB Output is correct
25 Correct 29 ms 26536 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 33 ms 26308 KB Output is correct
28 Correct 34 ms 26228 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 388 ms 26204 KB Output is correct
31 Correct 52 ms 26456 KB Output is correct
32 Correct 461 ms 26460 KB Output is correct
33 Correct 55 ms 26456 KB Output is correct
34 Correct 46 ms 26460 KB Output is correct
35 Correct 23 ms 14872 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 24 ms 14928 KB Output is correct
38 Correct 58 ms 9304 KB Output is correct
39 Correct 51 ms 9304 KB Output is correct
40 Correct 74 ms 27228 KB Output is correct
41 Correct 51 ms 9304 KB Output is correct
42 Correct 65 ms 27224 KB Output is correct
43 Correct 63 ms 27204 KB Output is correct
44 Correct 3 ms 3928 KB Output is correct
45 Correct 2071 ms 326428 KB Output is correct
46 Correct 372 ms 308356 KB Output is correct
47 Incorrect 2083 ms 326276 KB Output isn't correct
48 Halted 0 ms 0 KB -