oj.uz

답안 #1035527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035527 2024-07-26T11:44:43 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 337136 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] && sz+1 <= ans) || 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);
      }
    }
  }

  shuffle(all(vt), rng);
  for (int i = 0; i < n; i++) {
    if (r[vt[i]]) continue;

    c = 0;

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

    dfs(vt[i]);

    if (rng() % 5 == 0) r[vt[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:35:71: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if ((r[y] && sz+1 <= ans) || taken[y] || (taken & bt2[y]).count() < sz) continue;
      |                                              ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 3 ms 3984 KB Output is correct
3 Correct 29 ms 26204 KB Output is correct
4 Correct 18 ms 25692 KB Output is correct
5 Correct 18 ms 25628 KB Output is correct
6 Correct 20 ms 25948 KB Output is correct
7 Correct 20 ms 25892 KB Output is correct
8 Correct 15 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 3 ms 3984 KB Output is correct
3 Correct 29 ms 26204 KB Output is correct
4 Correct 18 ms 25692 KB Output is correct
5 Correct 18 ms 25628 KB Output is correct
6 Correct 20 ms 25948 KB Output is correct
7 Correct 20 ms 25892 KB Output is correct
8 Correct 15 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 19 ms 25692 KB Output is correct
12 Correct 18 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 19 ms 25508 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 20 ms 25832 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 22 ms 25948 KB Output is correct
19 Correct 14 ms 23896 KB Output is correct
20 Correct 11 ms 25308 KB Output is correct
21 Correct 10 ms 25552 KB Output is correct
22 Correct 10 ms 23892 KB Output is correct
23 Correct 30 ms 26508 KB Output is correct
24 Correct 11 ms 23896 KB Output is correct
25 Correct 25 ms 26460 KB Output is correct
26 Correct 34 ms 26200 KB Output is correct
27 Correct 31 ms 26204 KB Output is correct
28 Correct 35 ms 26180 KB Output is correct
29 Correct 32 ms 26200 KB Output is correct
30 Correct 1804 ms 26204 KB Output is correct
31 Correct 46 ms 26532 KB Output is correct
32 Correct 2005 ms 26460 KB Output is correct
33 Correct 54 ms 26456 KB Output is correct
34 Correct 46 ms 26456 KB Output is correct
35 Correct 24 ms 14680 KB Output is correct
36 Correct 24 ms 14680 KB Output is correct
37 Correct 22 ms 14684 KB Output is correct
38 Correct 48 ms 9308 KB Output is correct
39 Correct 50 ms 9304 KB Output is correct
40 Correct 71 ms 27480 KB Output is correct
41 Correct 62 ms 9368 KB Output is correct
42 Correct 60 ms 27224 KB Output is correct
43 Correct 56 ms 26968 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23860 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3928 KB Output is correct
4 Correct 2 ms 3932 KB Output is correct
5 Correct 2 ms 3988 KB Output is correct
6 Correct 2 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 2 ms 3932 KB Output is correct
11 Execution timed out 3103 ms 337136 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 3 ms 3984 KB Output is correct
3 Correct 29 ms 26204 KB Output is correct
4 Correct 18 ms 25692 KB Output is correct
5 Correct 18 ms 25628 KB Output is correct
6 Correct 20 ms 25948 KB Output is correct
7 Correct 20 ms 25892 KB Output is correct
8 Correct 15 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 19 ms 25692 KB Output is correct
12 Correct 18 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 19 ms 25508 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 20 ms 25832 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 22 ms 25948 KB Output is correct
19 Correct 14 ms 23896 KB Output is correct
20 Correct 11 ms 25308 KB Output is correct
21 Correct 10 ms 25552 KB Output is correct
22 Correct 10 ms 23892 KB Output is correct
23 Correct 30 ms 26508 KB Output is correct
24 Correct 11 ms 23896 KB Output is correct
25 Correct 25 ms 26460 KB Output is correct
26 Correct 34 ms 26200 KB Output is correct
27 Correct 31 ms 26204 KB Output is correct
28 Correct 35 ms 26180 KB Output is correct
29 Correct 32 ms 26200 KB Output is correct
30 Correct 1804 ms 26204 KB Output is correct
31 Correct 46 ms 26532 KB Output is correct
32 Correct 2005 ms 26460 KB Output is correct
33 Correct 54 ms 26456 KB Output is correct
34 Correct 46 ms 26456 KB Output is correct
35 Correct 24 ms 14680 KB Output is correct
36 Correct 24 ms 14680 KB Output is correct
37 Correct 22 ms 14684 KB Output is correct
38 Correct 48 ms 9308 KB Output is correct
39 Correct 50 ms 9304 KB Output is correct
40 Correct 71 ms 27480 KB Output is correct
41 Correct 62 ms 9368 KB Output is correct
42 Correct 60 ms 27224 KB Output is correct
43 Correct 56 ms 26968 KB Output is correct
44 Correct 18 ms 28764 KB Output is correct
45 Correct 2 ms 3932 KB Output is correct
46 Correct 53 ms 27152 KB Output is correct
47 Correct 234 ms 28748 KB Output is correct
48 Correct 65 ms 26972 KB Output is correct
49 Correct 216 ms 28764 KB Output is correct
50 Correct 230 ms 28672 KB Output is correct
51 Correct 897 ms 31324 KB Output is correct
52 Correct 21 ms 25944 KB Output is correct
53 Execution timed out 3078 ms 31840 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 3 ms 3984 KB Output is correct
3 Correct 29 ms 26204 KB Output is correct
4 Correct 18 ms 25692 KB Output is correct
5 Correct 18 ms 25628 KB Output is correct
6 Correct 20 ms 25948 KB Output is correct
7 Correct 20 ms 25892 KB Output is correct
8 Correct 15 ms 23900 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 19 ms 25692 KB Output is correct
12 Correct 18 ms 25692 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 19 ms 25508 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 20 ms 25832 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 22 ms 25948 KB Output is correct
19 Correct 14 ms 23896 KB Output is correct
20 Correct 11 ms 25308 KB Output is correct
21 Correct 10 ms 25552 KB Output is correct
22 Correct 10 ms 23892 KB Output is correct
23 Correct 30 ms 26508 KB Output is correct
24 Correct 11 ms 23896 KB Output is correct
25 Correct 25 ms 26460 KB Output is correct
26 Correct 34 ms 26200 KB Output is correct
27 Correct 31 ms 26204 KB Output is correct
28 Correct 35 ms 26180 KB Output is correct
29 Correct 32 ms 26200 KB Output is correct
30 Correct 1804 ms 26204 KB Output is correct
31 Correct 46 ms 26532 KB Output is correct
32 Correct 2005 ms 26460 KB Output is correct
33 Correct 54 ms 26456 KB Output is correct
34 Correct 46 ms 26456 KB Output is correct
35 Correct 24 ms 14680 KB Output is correct
36 Correct 24 ms 14680 KB Output is correct
37 Correct 22 ms 14684 KB Output is correct
38 Correct 48 ms 9308 KB Output is correct
39 Correct 50 ms 9304 KB Output is correct
40 Correct 71 ms 27480 KB Output is correct
41 Correct 62 ms 9368 KB Output is correct
42 Correct 60 ms 27224 KB Output is correct
43 Correct 56 ms 26968 KB Output is correct
44 Correct 2 ms 3928 KB Output is correct
45 Correct 1849 ms 325476 KB Output is correct
46 Correct 402 ms 308100 KB Output is correct
47 Correct 1601 ms 325336 KB Output is correct
48 Correct 2132 ms 325976 KB Output is correct
49 Correct 153 ms 280524 KB Output is correct
50 Execution timed out 3088 ms 332488 KB Time limit exceeded
51 Halted 0 ms 0 KB -