oj.uz

답안 #1035456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035456 2024-07-26T11:20:08 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
54 / 100
 3000 ms 337764 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 = 5e2;

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: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:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if (r[y] || 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 2 ms 3932 KB Output is correct
3 Correct 24 ms 26204 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 12 ms 25536 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 15 ms 25692 KB Output is correct
8 Correct 14 ms 24088 KB Output is correct
9 Correct 2 ms 3988 KB Output is correct
10 Correct 11 ms 23964 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26204 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 12 ms 25536 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 15 ms 25692 KB Output is correct
8 Correct 14 ms 24088 KB Output is correct
9 Correct 2 ms 3988 KB Output is correct
10 Correct 11 ms 23964 KB Output is correct
11 Correct 13 ms 25688 KB Output is correct
12 Correct 13 ms 25432 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 12 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25692 KB Output is correct
17 Correct 2 ms 4036 KB Output is correct
18 Correct 16 ms 25948 KB Output is correct
19 Correct 14 ms 23900 KB Output is correct
20 Correct 11 ms 25436 KB Output is correct
21 Correct 12 ms 25524 KB Output is correct
22 Correct 10 ms 23900 KB Output is correct
23 Correct 28 ms 26276 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 33 ms 26488 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 37 ms 26204 KB Output is correct
28 Correct 36 ms 26204 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 432 ms 26380 KB Output is correct
31 Correct 47 ms 26460 KB Output is correct
32 Correct 413 ms 26460 KB Output is correct
33 Correct 46 ms 26460 KB Output is correct
34 Correct 50 ms 26460 KB Output is correct
35 Correct 22 ms 14680 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 23 ms 14680 KB Output is correct
38 Correct 51 ms 9308 KB Output is correct
39 Correct 51 ms 9308 KB Output is correct
40 Correct 64 ms 27268 KB Output is correct
41 Correct 53 ms 9304 KB Output is correct
42 Correct 69 ms 27228 KB Output is correct
43 Correct 68 ms 26972 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23900 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3928 KB Output is correct
5 Correct 3 ms 4184 KB Output is correct
6 Correct 3 ms 3928 KB Output is correct
7 Correct 2 ms 3932 KB Output is correct
8 Correct 2 ms 4080 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 3110 ms 337764 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26204 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 12 ms 25536 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 15 ms 25692 KB Output is correct
8 Correct 14 ms 24088 KB Output is correct
9 Correct 2 ms 3988 KB Output is correct
10 Correct 11 ms 23964 KB Output is correct
11 Correct 13 ms 25688 KB Output is correct
12 Correct 13 ms 25432 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 12 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25692 KB Output is correct
17 Correct 2 ms 4036 KB Output is correct
18 Correct 16 ms 25948 KB Output is correct
19 Correct 14 ms 23900 KB Output is correct
20 Correct 11 ms 25436 KB Output is correct
21 Correct 12 ms 25524 KB Output is correct
22 Correct 10 ms 23900 KB Output is correct
23 Correct 28 ms 26276 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 33 ms 26488 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 37 ms 26204 KB Output is correct
28 Correct 36 ms 26204 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 432 ms 26380 KB Output is correct
31 Correct 47 ms 26460 KB Output is correct
32 Correct 413 ms 26460 KB Output is correct
33 Correct 46 ms 26460 KB Output is correct
34 Correct 50 ms 26460 KB Output is correct
35 Correct 22 ms 14680 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 23 ms 14680 KB Output is correct
38 Correct 51 ms 9308 KB Output is correct
39 Correct 51 ms 9308 KB Output is correct
40 Correct 64 ms 27268 KB Output is correct
41 Correct 53 ms 9304 KB Output is correct
42 Correct 69 ms 27228 KB Output is correct
43 Correct 68 ms 26972 KB Output is correct
44 Correct 17 ms 28760 KB Output is correct
45 Correct 2 ms 3932 KB Output is correct
46 Correct 54 ms 26968 KB Output is correct
47 Correct 235 ms 28752 KB Output is correct
48 Correct 79 ms 26972 KB Output is correct
49 Correct 227 ms 28764 KB Output is correct
50 Correct 263 ms 28508 KB Output is correct
51 Correct 763 ms 31424 KB Output is correct
52 Correct 11 ms 25948 KB Output is correct
53 Correct 1882 ms 32056 KB Output is correct
54 Correct 920 ms 32064 KB Output is correct
55 Correct 15 ms 25688 KB Output is correct
56 Correct 13 ms 26204 KB Output is correct
57 Correct 15 ms 23900 KB Output is correct
58 Correct 1937 ms 31956 KB Output is correct
59 Correct 24 ms 27236 KB Output is correct
60 Correct 21 ms 25692 KB Output is correct
61 Correct 12 ms 27228 KB Output is correct
62 Correct 14 ms 27324 KB Output is correct
63 Correct 17 ms 28764 KB Output is correct
64 Correct 27 ms 28328 KB Output is correct
65 Correct 41 ms 26972 KB Output is correct
66 Correct 19 ms 27224 KB Output is correct
67 Correct 233 ms 29168 KB Output is correct
68 Correct 17 ms 28508 KB Output is correct
69 Correct 48 ms 26968 KB Output is correct
70 Correct 274 ms 28856 KB Output is correct
71 Correct 204 ms 29276 KB Output is correct
72 Correct 239 ms 29288 KB Output is correct
73 Correct 33 ms 26200 KB Output is correct
74 Correct 214 ms 28508 KB Output is correct
75 Correct 248 ms 29276 KB Output is correct
76 Correct 670 ms 27856 KB Output is correct
77 Correct 424 ms 29948 KB Output is correct
78 Correct 36 ms 26204 KB Output is correct
79 Correct 215 ms 16364 KB Output is correct
80 Correct 714 ms 27988 KB Output is correct
81 Correct 425 ms 30036 KB Output is correct
82 Correct 51 ms 9304 KB Output is correct
83 Correct 217 ms 16220 KB Output is correct
84 Correct 283 ms 29272 KB Output is correct
85 Correct 53 ms 9308 KB Output is correct
86 Correct 298 ms 29524 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 24 ms 26204 KB Output is correct
4 Correct 12 ms 25688 KB Output is correct
5 Correct 12 ms 25536 KB Output is correct
6 Correct 14 ms 25948 KB Output is correct
7 Correct 15 ms 25692 KB Output is correct
8 Correct 14 ms 24088 KB Output is correct
9 Correct 2 ms 3988 KB Output is correct
10 Correct 11 ms 23964 KB Output is correct
11 Correct 13 ms 25688 KB Output is correct
12 Correct 13 ms 25432 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 12 ms 25436 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 15 ms 25692 KB Output is correct
17 Correct 2 ms 4036 KB Output is correct
18 Correct 16 ms 25948 KB Output is correct
19 Correct 14 ms 23900 KB Output is correct
20 Correct 11 ms 25436 KB Output is correct
21 Correct 12 ms 25524 KB Output is correct
22 Correct 10 ms 23900 KB Output is correct
23 Correct 28 ms 26276 KB Output is correct
24 Correct 10 ms 23900 KB Output is correct
25 Correct 33 ms 26488 KB Output is correct
26 Correct 36 ms 26204 KB Output is correct
27 Correct 37 ms 26204 KB Output is correct
28 Correct 36 ms 26204 KB Output is correct
29 Correct 34 ms 26204 KB Output is correct
30 Correct 432 ms 26380 KB Output is correct
31 Correct 47 ms 26460 KB Output is correct
32 Correct 413 ms 26460 KB Output is correct
33 Correct 46 ms 26460 KB Output is correct
34 Correct 50 ms 26460 KB Output is correct
35 Correct 22 ms 14680 KB Output is correct
36 Correct 24 ms 14684 KB Output is correct
37 Correct 23 ms 14680 KB Output is correct
38 Correct 51 ms 9308 KB Output is correct
39 Correct 51 ms 9308 KB Output is correct
40 Correct 64 ms 27268 KB Output is correct
41 Correct 53 ms 9304 KB Output is correct
42 Correct 69 ms 27228 KB Output is correct
43 Correct 68 ms 26972 KB Output is correct
44 Correct 2 ms 3932 KB Output is correct
45 Correct 2225 ms 325868 KB Output is correct
46 Correct 362 ms 308124 KB Output is correct
47 Correct 1899 ms 325620 KB Output is correct
48 Correct 1925 ms 325972 KB Output is correct
49 Correct 133 ms 280528 KB Output is correct
50 Execution timed out 3060 ms 332916 KB Time limit exceeded
51 Halted 0 ms 0 KB -