oj.uz

Submission #1035508

# Submission time Handle Problem Language Result Execution time Memory
1035508 2024-07-26T11:38:41 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 337908 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 = 1e3/*, X2 = 1e3*/;

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

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

    if (rng() % 5 == 0) r[i] = 1;
  }

  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:63:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |     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 26 ms 25948 KB Output is correct
4 Correct 12 ms 25692 KB Output is correct
5 Correct 18 ms 25436 KB Output is correct
6 Correct 15 ms 25944 KB Output is correct
7 Correct 18 ms 25692 KB Output is correct
8 Correct 18 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24096 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 26 ms 25948 KB Output is correct
4 Correct 12 ms 25692 KB Output is correct
5 Correct 18 ms 25436 KB Output is correct
6 Correct 15 ms 25944 KB Output is correct
7 Correct 18 ms 25692 KB Output is correct
8 Correct 18 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24096 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 17 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 14 ms 25512 KB Output is correct
15 Correct 2 ms 3948 KB Output is correct
16 Correct 14 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25732 KB Output is correct
19 Correct 19 ms 23900 KB Output is correct
20 Correct 12 ms 25432 KB Output is correct
21 Correct 12 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 26 ms 26688 KB Output is correct
24 Correct 10 ms 24036 KB Output is correct
25 Correct 27 ms 26460 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 32 ms 26204 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 322 ms 26400 KB Output is correct
31 Correct 47 ms 26644 KB Output is correct
32 Correct 686 ms 26488 KB Output is correct
33 Correct 45 ms 26588 KB Output is correct
34 Correct 46 ms 26472 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 23 ms 14684 KB Output is correct
37 Correct 23 ms 14916 KB Output is correct
38 Correct 51 ms 9368 KB Output is correct
39 Correct 43 ms 9308 KB Output is correct
40 Correct 61 ms 27248 KB Output is correct
41 Correct 39 ms 9304 KB Output is correct
42 Correct 60 ms 26972 KB Output is correct
43 Correct 65 ms 27224 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23896 KB Output is correct
2 Correct 3 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3932 KB Output is correct
5 Correct 3 ms 3928 KB Output is correct
6 Correct 3 ms 4184 KB Output is correct
7 Correct 3 ms 3928 KB Output is correct
8 Correct 3 ms 4088 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3932 KB Output is correct
11 Execution timed out 3111 ms 337908 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 26 ms 25948 KB Output is correct
4 Correct 12 ms 25692 KB Output is correct
5 Correct 18 ms 25436 KB Output is correct
6 Correct 15 ms 25944 KB Output is correct
7 Correct 18 ms 25692 KB Output is correct
8 Correct 18 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24096 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 17 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 14 ms 25512 KB Output is correct
15 Correct 2 ms 3948 KB Output is correct
16 Correct 14 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25732 KB Output is correct
19 Correct 19 ms 23900 KB Output is correct
20 Correct 12 ms 25432 KB Output is correct
21 Correct 12 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 26 ms 26688 KB Output is correct
24 Correct 10 ms 24036 KB Output is correct
25 Correct 27 ms 26460 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 32 ms 26204 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 322 ms 26400 KB Output is correct
31 Correct 47 ms 26644 KB Output is correct
32 Correct 686 ms 26488 KB Output is correct
33 Correct 45 ms 26588 KB Output is correct
34 Correct 46 ms 26472 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 23 ms 14684 KB Output is correct
37 Correct 23 ms 14916 KB Output is correct
38 Correct 51 ms 9368 KB Output is correct
39 Correct 43 ms 9308 KB Output is correct
40 Correct 61 ms 27248 KB Output is correct
41 Correct 39 ms 9304 KB Output is correct
42 Correct 60 ms 26972 KB Output is correct
43 Correct 65 ms 27224 KB Output is correct
44 Correct 18 ms 28760 KB Output is correct
45 Correct 2 ms 3932 KB Output is correct
46 Correct 52 ms 26972 KB Output is correct
47 Correct 210 ms 28756 KB Output is correct
48 Correct 70 ms 27092 KB Output is correct
49 Correct 213 ms 28760 KB Output is correct
50 Correct 221 ms 28504 KB Output is correct
51 Incorrect 807 ms 31400 KB Output isn't correct
52 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 26 ms 25948 KB Output is correct
4 Correct 12 ms 25692 KB Output is correct
5 Correct 18 ms 25436 KB Output is correct
6 Correct 15 ms 25944 KB Output is correct
7 Correct 18 ms 25692 KB Output is correct
8 Correct 18 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 10 ms 24096 KB Output is correct
11 Correct 13 ms 25692 KB Output is correct
12 Correct 17 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 14 ms 25512 KB Output is correct
15 Correct 2 ms 3948 KB Output is correct
16 Correct 14 ms 25692 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 14 ms 25732 KB Output is correct
19 Correct 19 ms 23900 KB Output is correct
20 Correct 12 ms 25432 KB Output is correct
21 Correct 12 ms 25436 KB Output is correct
22 Correct 9 ms 23900 KB Output is correct
23 Correct 26 ms 26688 KB Output is correct
24 Correct 10 ms 24036 KB Output is correct
25 Correct 27 ms 26460 KB Output is correct
26 Correct 35 ms 26204 KB Output is correct
27 Correct 32 ms 26204 KB Output is correct
28 Correct 35 ms 26200 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 322 ms 26400 KB Output is correct
31 Correct 47 ms 26644 KB Output is correct
32 Correct 686 ms 26488 KB Output is correct
33 Correct 45 ms 26588 KB Output is correct
34 Correct 46 ms 26472 KB Output is correct
35 Correct 23 ms 14684 KB Output is correct
36 Correct 23 ms 14684 KB Output is correct
37 Correct 23 ms 14916 KB Output is correct
38 Correct 51 ms 9368 KB Output is correct
39 Correct 43 ms 9308 KB Output is correct
40 Correct 61 ms 27248 KB Output is correct
41 Correct 39 ms 9304 KB Output is correct
42 Correct 60 ms 26972 KB Output is correct
43 Correct 65 ms 27224 KB Output is correct
44 Correct 2 ms 3932 KB Output is correct
45 Correct 1761 ms 325924 KB Output is correct
46 Correct 309 ms 308352 KB Output is correct
47 Correct 1599 ms 326224 KB Output is correct
48 Correct 1838 ms 326224 KB Output is correct
49 Correct 143 ms 280784 KB Output is correct
50 Execution timed out 3091 ms 333432 KB Time limit exceeded
51 Halted 0 ms 0 KB -