oj.uz

Submission #1035453

# Submission time Handle Problem Language Result Execution time Memory
1035453 2024-07-26T11:19:20 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 338164 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 = 5e3;

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 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];

    dfs(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 dfs(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;
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

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 25 ms 26204 KB Output is correct
4 Correct 13 ms 25516 KB Output is correct
5 Correct 13 ms 25504 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 17 ms 25648 KB Output is correct
8 Correct 15 ms 23896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 9 ms 24056 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 25 ms 26204 KB Output is correct
4 Correct 13 ms 25516 KB Output is correct
5 Correct 13 ms 25504 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 17 ms 25648 KB Output is correct
8 Correct 15 ms 23896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 9 ms 24056 KB Output is correct
11 Correct 12 ms 25688 KB Output is correct
12 Correct 12 ms 25688 KB Output is correct
13 Correct 2 ms 3928 KB Output is correct
14 Correct 12 ms 25456 KB Output is correct
15 Correct 2 ms 3928 KB Output is correct
16 Correct 15 ms 25948 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25944 KB Output is correct
19 Correct 14 ms 23860 KB Output is correct
20 Correct 11 ms 25432 KB Output is correct
21 Correct 11 ms 25432 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 24 ms 26460 KB Output is correct
24 Correct 10 ms 23896 KB Output is correct
25 Correct 28 ms 26456 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 34 ms 26200 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26200 KB Output is correct
30 Correct 1182 ms 26396 KB Output is correct
31 Correct 57 ms 26460 KB Output is correct
32 Correct 1300 ms 26456 KB Output is correct
33 Correct 52 ms 26644 KB Output is correct
34 Correct 49 ms 26456 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 33 ms 14896 KB Output is correct
37 Correct 24 ms 14680 KB Output is correct
38 Correct 73 ms 9372 KB Output is correct
39 Correct 54 ms 9308 KB Output is correct
40 Correct 93 ms 27252 KB Output is correct
41 Correct 61 ms 9368 KB Output is correct
42 Correct 66 ms 26972 KB Output is correct
43 Correct 70 ms 26972 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23996 KB Output is correct
2 Correct 2 ms 3928 KB Output is correct
3 Correct 3 ms 3932 KB Output is correct
4 Correct 3 ms 3932 KB Output is correct
5 Correct 3 ms 3932 KB Output is correct
6 Correct 4 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 4 ms 3932 KB Output is correct
10 Correct 3 ms 3932 KB Output is correct
11 Execution timed out 3115 ms 338164 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
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 25 ms 26204 KB Output is correct
4 Correct 13 ms 25516 KB Output is correct
5 Correct 13 ms 25504 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 17 ms 25648 KB Output is correct
8 Correct 15 ms 23896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 9 ms 24056 KB Output is correct
11 Correct 12 ms 25688 KB Output is correct
12 Correct 12 ms 25688 KB Output is correct
13 Correct 2 ms 3928 KB Output is correct
14 Correct 12 ms 25456 KB Output is correct
15 Correct 2 ms 3928 KB Output is correct
16 Correct 15 ms 25948 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25944 KB Output is correct
19 Correct 14 ms 23860 KB Output is correct
20 Correct 11 ms 25432 KB Output is correct
21 Correct 11 ms 25432 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 24 ms 26460 KB Output is correct
24 Correct 10 ms 23896 KB Output is correct
25 Correct 28 ms 26456 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 34 ms 26200 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26200 KB Output is correct
30 Correct 1182 ms 26396 KB Output is correct
31 Correct 57 ms 26460 KB Output is correct
32 Correct 1300 ms 26456 KB Output is correct
33 Correct 52 ms 26644 KB Output is correct
34 Correct 49 ms 26456 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 33 ms 14896 KB Output is correct
37 Correct 24 ms 14680 KB Output is correct
38 Correct 73 ms 9372 KB Output is correct
39 Correct 54 ms 9308 KB Output is correct
40 Correct 93 ms 27252 KB Output is correct
41 Correct 61 ms 9368 KB Output is correct
42 Correct 66 ms 26972 KB Output is correct
43 Correct 70 ms 26972 KB Output is correct
44 Correct 24 ms 28816 KB Output is correct
45 Correct 3 ms 3928 KB Output is correct
46 Correct 57 ms 27156 KB Output is correct
47 Correct 290 ms 28752 KB Output is correct
48 Correct 83 ms 27084 KB Output is correct
49 Correct 324 ms 28812 KB Output is correct
50 Correct 337 ms 28680 KB Output is correct
51 Correct 1268 ms 31268 KB Output is correct
52 Correct 13 ms 25948 KB Output is correct
53 Execution timed out 3074 ms 31832 KB Time limit exceeded
54 Halted 0 ms 0 KB -

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 25 ms 26204 KB Output is correct
4 Correct 13 ms 25516 KB Output is correct
5 Correct 13 ms 25504 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 17 ms 25648 KB Output is correct
8 Correct 15 ms 23896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 9 ms 24056 KB Output is correct
11 Correct 12 ms 25688 KB Output is correct
12 Correct 12 ms 25688 KB Output is correct
13 Correct 2 ms 3928 KB Output is correct
14 Correct 12 ms 25456 KB Output is correct
15 Correct 2 ms 3928 KB Output is correct
16 Correct 15 ms 25948 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25944 KB Output is correct
19 Correct 14 ms 23860 KB Output is correct
20 Correct 11 ms 25432 KB Output is correct
21 Correct 11 ms 25432 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 24 ms 26460 KB Output is correct
24 Correct 10 ms 23896 KB Output is correct
25 Correct 28 ms 26456 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 34 ms 26200 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26200 KB Output is correct
30 Correct 1182 ms 26396 KB Output is correct
31 Correct 57 ms 26460 KB Output is correct
32 Correct 1300 ms 26456 KB Output is correct
33 Correct 52 ms 26644 KB Output is correct
34 Correct 49 ms 26456 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 33 ms 14896 KB Output is correct
37 Correct 24 ms 14680 KB Output is correct
38 Correct 73 ms 9372 KB Output is correct
39 Correct 54 ms 9308 KB Output is correct
40 Correct 93 ms 27252 KB Output is correct
41 Correct 61 ms 9368 KB Output is correct
42 Correct 66 ms 26972 KB Output is correct
43 Correct 70 ms 26972 KB Output is correct
44 Correct 2 ms 3928 KB Output is correct
45 Correct 2170 ms 326344 KB Output is correct
46 Correct 324 ms 308356 KB Output is correct
47 Correct 1863 ms 326224 KB Output is correct
48 Correct 2083 ms 326644 KB Output is correct
49 Correct 147 ms 280784 KB Output is correct
50 Execution timed out 3070 ms 333512 KB Time limit exceeded
51 Halted 0 ms 0 KB -