oj.uz

Submission #1035465

# Submission time Handle Problem Language Result Execution time Memory
1035465 2024-07-26T11:21:58 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 337168 KB 
#pragma GCC optimize ("O3")
//#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 = 4e2;

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:20:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if (adj[i].size()+1 < x) r[i] = 1;
      |         ~~~~~~~~~~~~~~~~^~~
politicaldevelopment.cpp: In function 'void dfs(int)':
politicaldevelopment.cpp:36:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     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 52 ms 25944 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 12 ms 25436 KB Output is correct
6 Correct 21 ms 25692 KB Output is correct
7 Correct 22 ms 25692 KB Output is correct
8 Correct 20 ms 24080 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 23900 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 52 ms 25944 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 12 ms 25436 KB Output is correct
6 Correct 21 ms 25692 KB Output is correct
7 Correct 22 ms 25692 KB Output is correct
8 Correct 20 ms 24080 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 12 ms 25436 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 15 ms 25312 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 22 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 23 ms 25904 KB Output is correct
19 Correct 20 ms 23900 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 48 ms 26444 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 66 ms 26396 KB Output is correct
26 Correct 91 ms 26032 KB Output is correct
27 Correct 98 ms 26200 KB Output is correct
28 Correct 111 ms 26164 KB Output is correct
29 Correct 95 ms 26200 KB Output is correct
30 Correct 1209 ms 26332 KB Output is correct
31 Correct 147 ms 26704 KB Output is correct
32 Correct 1316 ms 26492 KB Output is correct
33 Correct 154 ms 26428 KB Output is correct
34 Correct 144 ms 26460 KB Output is correct
35 Correct 78 ms 14684 KB Output is correct
36 Correct 70 ms 14680 KB Output is correct
37 Correct 67 ms 14908 KB Output is correct
38 Correct 189 ms 9308 KB Output is correct
39 Correct 179 ms 9308 KB Output is correct
40 Correct 218 ms 27224 KB Output is correct
41 Correct 194 ms 9372 KB Output is correct
42 Correct 197 ms 26968 KB Output is correct
43 Correct 208 ms 26972 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23900 KB Output is correct
2 Correct 4 ms 3932 KB Output is correct
3 Correct 4 ms 3932 KB Output is correct
4 Correct 2 ms 4184 KB Output is correct
5 Correct 5 ms 3932 KB Output is correct
6 Correct 5 ms 4116 KB Output is correct
7 Correct 5 ms 3988 KB Output is correct
8 Correct 4 ms 3932 KB Output is correct
9 Correct 5 ms 4116 KB Output is correct
10 Correct 4 ms 4108 KB Output is correct
11 Execution timed out 3095 ms 337168 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 52 ms 25944 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 12 ms 25436 KB Output is correct
6 Correct 21 ms 25692 KB Output is correct
7 Correct 22 ms 25692 KB Output is correct
8 Correct 20 ms 24080 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 12 ms 25436 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 15 ms 25312 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 22 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 23 ms 25904 KB Output is correct
19 Correct 20 ms 23900 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 48 ms 26444 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 66 ms 26396 KB Output is correct
26 Correct 91 ms 26032 KB Output is correct
27 Correct 98 ms 26200 KB Output is correct
28 Correct 111 ms 26164 KB Output is correct
29 Correct 95 ms 26200 KB Output is correct
30 Correct 1209 ms 26332 KB Output is correct
31 Correct 147 ms 26704 KB Output is correct
32 Correct 1316 ms 26492 KB Output is correct
33 Correct 154 ms 26428 KB Output is correct
34 Correct 144 ms 26460 KB Output is correct
35 Correct 78 ms 14684 KB Output is correct
36 Correct 70 ms 14680 KB Output is correct
37 Correct 67 ms 14908 KB Output is correct
38 Correct 189 ms 9308 KB Output is correct
39 Correct 179 ms 9308 KB Output is correct
40 Correct 218 ms 27224 KB Output is correct
41 Correct 194 ms 9372 KB Output is correct
42 Correct 197 ms 26968 KB Output is correct
43 Correct 208 ms 26972 KB Output is correct
44 Correct 18 ms 28764 KB Output is correct
45 Correct 2 ms 3932 KB Output is correct
46 Correct 167 ms 27156 KB Output is correct
47 Correct 867 ms 28756 KB Output is correct
48 Correct 232 ms 26972 KB Output is correct
49 Correct 805 ms 28804 KB Output is correct
50 Correct 825 ms 28508 KB Output is correct
51 Correct 2467 ms 31324 KB Output is correct
52 Correct 12 ms 25948 KB Output is correct
53 Execution timed out 3097 ms 31928 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 52 ms 25944 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 12 ms 25436 KB Output is correct
6 Correct 21 ms 25692 KB Output is correct
7 Correct 22 ms 25692 KB Output is correct
8 Correct 20 ms 24080 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 12 ms 25436 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 15 ms 25312 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 22 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 23 ms 25904 KB Output is correct
19 Correct 20 ms 23900 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 48 ms 26444 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 66 ms 26396 KB Output is correct
26 Correct 91 ms 26032 KB Output is correct
27 Correct 98 ms 26200 KB Output is correct
28 Correct 111 ms 26164 KB Output is correct
29 Correct 95 ms 26200 KB Output is correct
30 Correct 1209 ms 26332 KB Output is correct
31 Correct 147 ms 26704 KB Output is correct
32 Correct 1316 ms 26492 KB Output is correct
33 Correct 154 ms 26428 KB Output is correct
34 Correct 144 ms 26460 KB Output is correct
35 Correct 78 ms 14684 KB Output is correct
36 Correct 70 ms 14680 KB Output is correct
37 Correct 67 ms 14908 KB Output is correct
38 Correct 189 ms 9308 KB Output is correct
39 Correct 179 ms 9308 KB Output is correct
40 Correct 218 ms 27224 KB Output is correct
41 Correct 194 ms 9372 KB Output is correct
42 Correct 197 ms 26968 KB Output is correct
43 Correct 208 ms 26972 KB Output is correct
44 Correct 2 ms 3932 KB Output is correct
45 Execution timed out 3091 ms 326420 KB Time limit exceeded
46 Halted 0 ms 0 KB -