oj.uz

답안 #1035451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035451 2024-07-26T11:16:47 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 524288 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];
bitset<N> bt[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;
      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);
      }
    }
  }

  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:18:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     if (adj[i].size()+1 < x) r[i] = 1;
      |         ~~~~~~~~~~~~~~~~^~~
politicaldevelopment.cpp: In function 'void dfs(int)':
politicaldevelopment.cpp:34:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |     if (r[y] || taken[y] || (taken & bt2[y]).count() < sz) continue;
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 32 ms 43908 KB Output is correct
4 Correct 17 ms 42840 KB Output is correct
5 Correct 17 ms 42584 KB Output is correct
6 Correct 19 ms 43204 KB Output is correct
7 Correct 19 ms 42844 KB Output is correct
8 Correct 12 ms 21592 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 8 ms 21752 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 32 ms 43908 KB Output is correct
4 Correct 17 ms 42840 KB Output is correct
5 Correct 17 ms 42584 KB Output is correct
6 Correct 19 ms 43204 KB Output is correct
7 Correct 19 ms 42844 KB Output is correct
8 Correct 12 ms 21592 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 8 ms 21752 KB Output is correct
11 Correct 17 ms 42768 KB Output is correct
12 Correct 18 ms 42844 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 19 ms 42588 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 20 ms 43100 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 20 ms 43208 KB Output is correct
19 Correct 13 ms 21596 KB Output is correct
20 Correct 16 ms 42844 KB Output is correct
21 Correct 16 ms 42964 KB Output is correct
22 Correct 7 ms 21596 KB Output is correct
23 Correct 30 ms 44584 KB Output is correct
24 Correct 8 ms 21676 KB Output is correct
25 Correct 34 ms 44732 KB Output is correct
26 Correct 42 ms 43608 KB Output is correct
27 Correct 41 ms 44380 KB Output is correct
28 Correct 41 ms 43608 KB Output is correct
29 Correct 40 ms 44376 KB Output is correct
30 Correct 1156 ms 44372 KB Output is correct
31 Correct 55 ms 44892 KB Output is correct
32 Correct 1139 ms 44376 KB Output is correct
33 Correct 53 ms 44860 KB Output is correct
34 Correct 56 ms 44756 KB Output is correct
35 Correct 27 ms 22364 KB Output is correct
36 Correct 26 ms 22364 KB Output is correct
37 Correct 26 ms 22364 KB Output is correct
38 Correct 51 ms 11868 KB Output is correct
39 Correct 52 ms 11608 KB Output is correct
40 Correct 77 ms 45528 KB Output is correct
41 Correct 53 ms 11612 KB Output is correct
42 Correct 75 ms 45400 KB Output is correct
43 Correct 82 ms 45496 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 21596 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 2 ms 1628 KB Output is correct
6 Correct 2 ms 1628 KB Output is correct
7 Correct 2 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Runtime error 273 ms 524288 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 32 ms 43908 KB Output is correct
4 Correct 17 ms 42840 KB Output is correct
5 Correct 17 ms 42584 KB Output is correct
6 Correct 19 ms 43204 KB Output is correct
7 Correct 19 ms 42844 KB Output is correct
8 Correct 12 ms 21592 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 8 ms 21752 KB Output is correct
11 Correct 17 ms 42768 KB Output is correct
12 Correct 18 ms 42844 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 19 ms 42588 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 20 ms 43100 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 20 ms 43208 KB Output is correct
19 Correct 13 ms 21596 KB Output is correct
20 Correct 16 ms 42844 KB Output is correct
21 Correct 16 ms 42964 KB Output is correct
22 Correct 7 ms 21596 KB Output is correct
23 Correct 30 ms 44584 KB Output is correct
24 Correct 8 ms 21676 KB Output is correct
25 Correct 34 ms 44732 KB Output is correct
26 Correct 42 ms 43608 KB Output is correct
27 Correct 41 ms 44380 KB Output is correct
28 Correct 41 ms 43608 KB Output is correct
29 Correct 40 ms 44376 KB Output is correct
30 Correct 1156 ms 44372 KB Output is correct
31 Correct 55 ms 44892 KB Output is correct
32 Correct 1139 ms 44376 KB Output is correct
33 Correct 53 ms 44860 KB Output is correct
34 Correct 56 ms 44756 KB Output is correct
35 Correct 27 ms 22364 KB Output is correct
36 Correct 26 ms 22364 KB Output is correct
37 Correct 26 ms 22364 KB Output is correct
38 Correct 51 ms 11868 KB Output is correct
39 Correct 52 ms 11608 KB Output is correct
40 Correct 77 ms 45528 KB Output is correct
41 Correct 53 ms 11612 KB Output is correct
42 Correct 75 ms 45400 KB Output is correct
43 Correct 82 ms 45496 KB Output is correct
44 Correct 29 ms 46684 KB Output is correct
45 Correct 1 ms 1624 KB Output is correct
46 Correct 65 ms 45372 KB Output is correct
47 Correct 280 ms 46676 KB Output is correct
48 Correct 84 ms 45344 KB Output is correct
49 Correct 290 ms 46672 KB Output is correct
50 Correct 287 ms 46432 KB Output is correct
51 Correct 1043 ms 47596 KB Output is correct
52 Correct 19 ms 43100 KB Output is correct
53 Execution timed out 3073 ms 47708 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 32 ms 43908 KB Output is correct
4 Correct 17 ms 42840 KB Output is correct
5 Correct 17 ms 42584 KB Output is correct
6 Correct 19 ms 43204 KB Output is correct
7 Correct 19 ms 42844 KB Output is correct
8 Correct 12 ms 21592 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 8 ms 21752 KB Output is correct
11 Correct 17 ms 42768 KB Output is correct
12 Correct 18 ms 42844 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 19 ms 42588 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 20 ms 43100 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 20 ms 43208 KB Output is correct
19 Correct 13 ms 21596 KB Output is correct
20 Correct 16 ms 42844 KB Output is correct
21 Correct 16 ms 42964 KB Output is correct
22 Correct 7 ms 21596 KB Output is correct
23 Correct 30 ms 44584 KB Output is correct
24 Correct 8 ms 21676 KB Output is correct
25 Correct 34 ms 44732 KB Output is correct
26 Correct 42 ms 43608 KB Output is correct
27 Correct 41 ms 44380 KB Output is correct
28 Correct 41 ms 43608 KB Output is correct
29 Correct 40 ms 44376 KB Output is correct
30 Correct 1156 ms 44372 KB Output is correct
31 Correct 55 ms 44892 KB Output is correct
32 Correct 1139 ms 44376 KB Output is correct
33 Correct 53 ms 44860 KB Output is correct
34 Correct 56 ms 44756 KB Output is correct
35 Correct 27 ms 22364 KB Output is correct
36 Correct 26 ms 22364 KB Output is correct
37 Correct 26 ms 22364 KB Output is correct
38 Correct 51 ms 11868 KB Output is correct
39 Correct 52 ms 11608 KB Output is correct
40 Correct 77 ms 45528 KB Output is correct
41 Correct 53 ms 11612 KB Output is correct
42 Correct 75 ms 45400 KB Output is correct
43 Correct 82 ms 45496 KB Output is correct
44 Correct 1 ms 1628 KB Output is correct
45 Runtime error 259 ms 524288 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -