oj.uz

Submission #1035425

# Submission time Handle Problem Language Result Execution time Memory
1035425 2024-07-26T10:55:54 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 2502 ms 7084 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 = 5e3, X = 5e0, X2 = 5e0;

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

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

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

  int sz = taken.count();
  ans = max(ans, sz);
  
  shuffle(all(adj[x]), rng);
  for (int& y : adj[x]) {
    if (!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();
  ans = max(ans, sz);

  shuffle(all(adj[x]), rng);
  for (int& y : adj[x]) {
    if (!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;
  c = 0;
  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;
      bt[i][y] = 1;

      if (bt[y][i]) {
        bt2[i][y] = 1;
        adj[i].push_back(y);

        bt2[y][i] = 1;
        adj[y].push_back(i);
      }
    }
  }
  shuffle(all(vt), rng);

  for (int i = 0; i < n && c < X; i++) {
    dfs(vt[i]);
  }

  for (int i = 0; i < n; i++) {
    c = 0;
    taken.reset();
    toTake.reset();
    toTake = ~toTake;
    dfs2(vt[i]);
  }

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

Compilation message

politicaldevelopment.cpp: In function 'void dfs2(int)':
politicaldevelopment.cpp:24:47: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |     if (!taken[y] && (taken & bt2[y]).count() < sz) continue;
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
politicaldevelopment.cpp: In function 'void dfs(int)':
politicaldevelopment.cpp:46:47: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |     if (!taken[y] && (taken & bt2[y]).count() < sz) continue;
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 10 ms 6996 KB Output is correct
4 Correct 2398 ms 7000 KB Output is correct
5 Correct 2346 ms 7004 KB Output is correct
6 Correct 44 ms 7004 KB Output is correct
7 Correct 44 ms 7004 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 3676 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 10 ms 6996 KB Output is correct
4 Correct 2398 ms 7000 KB Output is correct
5 Correct 2346 ms 7004 KB Output is correct
6 Correct 44 ms 7004 KB Output is correct
7 Correct 44 ms 7004 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 3676 KB Output is correct
11 Correct 2464 ms 7004 KB Output is correct
12 Correct 2299 ms 7000 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2502 ms 6880 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 44 ms 7000 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 46 ms 7016 KB Output is correct
19 Correct 3 ms 3676 KB Output is correct
20 Correct 7 ms 6748 KB Output is correct
21 Correct 7 ms 6748 KB Output is correct
22 Correct 2 ms 3676 KB Output is correct
23 Correct 10 ms 7000 KB Output is correct
24 Correct 2 ms 3676 KB Output is correct
25 Correct 10 ms 7004 KB Output is correct
26 Correct 10 ms 6916 KB Output is correct
27 Correct 9 ms 7004 KB Output is correct
28 Correct 10 ms 7004 KB Output is correct
29 Correct 9 ms 6744 KB Output is correct
30 Correct 417 ms 7000 KB Output is correct
31 Correct 10 ms 7004 KB Output is correct
32 Correct 407 ms 7004 KB Output is correct
33 Correct 10 ms 7004 KB Output is correct
34 Correct 11 ms 7004 KB Output is correct
35 Correct 5 ms 3612 KB Output is correct
36 Correct 6 ms 3676 KB Output is correct
37 Correct 5 ms 3676 KB Output is correct
38 Correct 7 ms 2140 KB Output is correct
39 Correct 6 ms 2140 KB Output is correct
40 Correct 13 ms 7000 KB Output is correct
41 Correct 6 ms 2140 KB Output is correct
42 Correct 14 ms 7084 KB Output is correct
43 Correct 15 ms 7072 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3684 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Incorrect 0 ms 604 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 10 ms 6996 KB Output is correct
4 Correct 2398 ms 7000 KB Output is correct
5 Correct 2346 ms 7004 KB Output is correct
6 Correct 44 ms 7004 KB Output is correct
7 Correct 44 ms 7004 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 3676 KB Output is correct
11 Correct 2464 ms 7004 KB Output is correct
12 Correct 2299 ms 7000 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2502 ms 6880 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 44 ms 7000 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 46 ms 7016 KB Output is correct
19 Correct 3 ms 3676 KB Output is correct
20 Correct 7 ms 6748 KB Output is correct
21 Correct 7 ms 6748 KB Output is correct
22 Correct 2 ms 3676 KB Output is correct
23 Correct 10 ms 7000 KB Output is correct
24 Correct 2 ms 3676 KB Output is correct
25 Correct 10 ms 7004 KB Output is correct
26 Correct 10 ms 6916 KB Output is correct
27 Correct 9 ms 7004 KB Output is correct
28 Correct 10 ms 7004 KB Output is correct
29 Correct 9 ms 6744 KB Output is correct
30 Correct 417 ms 7000 KB Output is correct
31 Correct 10 ms 7004 KB Output is correct
32 Correct 407 ms 7004 KB Output is correct
33 Correct 10 ms 7004 KB Output is correct
34 Correct 11 ms 7004 KB Output is correct
35 Correct 5 ms 3612 KB Output is correct
36 Correct 6 ms 3676 KB Output is correct
37 Correct 5 ms 3676 KB Output is correct
38 Correct 7 ms 2140 KB Output is correct
39 Correct 6 ms 2140 KB Output is correct
40 Correct 13 ms 7000 KB Output is correct
41 Correct 6 ms 2140 KB Output is correct
42 Correct 14 ms 7084 KB Output is correct
43 Correct 15 ms 7072 KB Output is correct
44 Incorrect 14 ms 7000 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 10 ms 6996 KB Output is correct
4 Correct 2398 ms 7000 KB Output is correct
5 Correct 2346 ms 7004 KB Output is correct
6 Correct 44 ms 7004 KB Output is correct
7 Correct 44 ms 7004 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 3676 KB Output is correct
11 Correct 2464 ms 7004 KB Output is correct
12 Correct 2299 ms 7000 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2502 ms 6880 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 44 ms 7000 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 46 ms 7016 KB Output is correct
19 Correct 3 ms 3676 KB Output is correct
20 Correct 7 ms 6748 KB Output is correct
21 Correct 7 ms 6748 KB Output is correct
22 Correct 2 ms 3676 KB Output is correct
23 Correct 10 ms 7000 KB Output is correct
24 Correct 2 ms 3676 KB Output is correct
25 Correct 10 ms 7004 KB Output is correct
26 Correct 10 ms 6916 KB Output is correct
27 Correct 9 ms 7004 KB Output is correct
28 Correct 10 ms 7004 KB Output is correct
29 Correct 9 ms 6744 KB Output is correct
30 Correct 417 ms 7000 KB Output is correct
31 Correct 10 ms 7004 KB Output is correct
32 Correct 407 ms 7004 KB Output is correct
33 Correct 10 ms 7004 KB Output is correct
34 Correct 11 ms 7004 KB Output is correct
35 Correct 5 ms 3612 KB Output is correct
36 Correct 6 ms 3676 KB Output is correct
37 Correct 5 ms 3676 KB Output is correct
38 Correct 7 ms 2140 KB Output is correct
39 Correct 6 ms 2140 KB Output is correct
40 Correct 13 ms 7000 KB Output is correct
41 Correct 6 ms 2140 KB Output is correct
42 Correct 14 ms 7084 KB Output is correct
43 Correct 15 ms 7072 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Runtime error 1 ms 1116 KB Execution killed with signal 11
46 Halted 0 ms 0 KB -