oj.uz

답안 #1035302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035302 2024-07-26T09:06:10 Z vjudge1 Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 312572 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;

const int N = 5e4;

mt19937 rng(time(nullptr) + 69);

int n, k, cnt[N];
vector<int> rem, adj[N];
bitset<N> bt[N], curr;

bool solve(int tot, int x, int y) {
  //cerr << tot << " " << x << " " << y << " " << curr.count() << endl;
  if (curr.count() < tot) return 0;
  else if (!x) return 1;

  // tengo que pillar x mas, mayores que y, tengo curr odiados

  vector<int> temp;
  int sz = rem.size();
  for (int i = sz-1; i >= 0; i--) {
    if (rem[i] <= y) break;
    temp.push_back(rem[i]);
  }
  shuffle(temp.begin(), temp.end(), rng);

  sz = temp.size();
  if (sz < x-1) return 0;
  for (int i = 0; i < sz; i++) {
    bitset<N> prv = curr;
    curr &= bt[temp[i]];
    if (solve(tot, x-1, temp[i])) return 1;
    swap(curr, prv);
  }
  return 0;
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n >> k;
  memset(cnt, 0, sizeof(cnt));
  rem.resize(n);
  for (int i = 0; i < n; i++) {
    rem[i] = i;
    int x; cin >> x;
    bt[i][i] = 1;
    cnt[i]++;
    adj[i].push_back(i);
    for (int j = 0; j < x; j++) {
      int y; cin >> y;
      bt[i][y] = 1;
      cnt[y]++;
      adj[i].push_back(y);
    }
  }

  int ans = 0;
  for (int i = 1; i <= k; i++) {
    curr.reset();
    for (int& j : rem) curr[j] = 1;
    if (!solve(i, i, -1)) break;
    ans = i;

    // limpiar
    while (1) {
      int sz = rem.size();
      vector<int> nw;
      bool ch = 0;
      for (int j = 0; j < sz; j++) {
        int c = 0;
        for (int& k : adj[rem[j]]) {
          if (cnt[k] >= i) c++; 
        }
        if (c >= i) {
          nw.push_back(rem[j]);
          continue;
        }
        ch = 1;
        for (int& k : adj[rem[j]]) {
          cnt[k]--;
        }
      }
      swap(nw, rem);
      if (!ch) break;
    }
  }

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

Compilation message

politicaldevelopment.cpp: In function 'bool solve(int, int, int)':
politicaldevelopment.cpp:16:20: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |   if (curr.count() < tot) return 0;
      |       ~~~~~~~~~~~~~^~~~~

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 12 ms 23376 KB Output is correct
4 Correct 25 ms 23076 KB Output is correct
5 Correct 26 ms 23016 KB Output is correct
6 Correct 12 ms 23132 KB Output is correct
7 Correct 23 ms 23240 KB Output is correct
8 Correct 15 ms 22104 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 9 ms 22108 KB Output is correct

Subtask #2
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 12 ms 23376 KB Output is correct
4 Correct 25 ms 23076 KB Output is correct
5 Correct 26 ms 23016 KB Output is correct
6 Correct 12 ms 23132 KB Output is correct
7 Correct 23 ms 23240 KB Output is correct
8 Correct 15 ms 22104 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 9 ms 22108 KB Output is correct
11 Correct 25 ms 23132 KB Output is correct
12 Correct 30 ms 22992 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 22 ms 22968 KB Output is correct
15 Correct 1 ms 1624 KB Output is correct
16 Correct 174 ms 23236 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 176 ms 23284 KB Output is correct
19 Correct 16 ms 22108 KB Output is correct
20 Correct 12 ms 23008 KB Output is correct
21 Correct 23 ms 23208 KB Output is correct
22 Correct 13 ms 22104 KB Output is correct
23 Correct 1692 ms 23772 KB Output is correct
24 Correct 14 ms 22108 KB Output is correct
25 Execution timed out 3093 ms 23900 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22108 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Execution timed out 3074 ms 312572 KB Time limit exceeded
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 12 ms 23376 KB Output is correct
4 Correct 25 ms 23076 KB Output is correct
5 Correct 26 ms 23016 KB Output is correct
6 Correct 12 ms 23132 KB Output is correct
7 Correct 23 ms 23240 KB Output is correct
8 Correct 15 ms 22104 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 9 ms 22108 KB Output is correct
11 Correct 25 ms 23132 KB Output is correct
12 Correct 30 ms 22992 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 22 ms 22968 KB Output is correct
15 Correct 1 ms 1624 KB Output is correct
16 Correct 174 ms 23236 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 176 ms 23284 KB Output is correct
19 Correct 16 ms 22108 KB Output is correct
20 Correct 12 ms 23008 KB Output is correct
21 Correct 23 ms 23208 KB Output is correct
22 Correct 13 ms 22104 KB Output is correct
23 Correct 1692 ms 23772 KB Output is correct
24 Correct 14 ms 22108 KB Output is correct
25 Execution timed out 3093 ms 23900 KB Time limit exceeded
26 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 12 ms 23376 KB Output is correct
4 Correct 25 ms 23076 KB Output is correct
5 Correct 26 ms 23016 KB Output is correct
6 Correct 12 ms 23132 KB Output is correct
7 Correct 23 ms 23240 KB Output is correct
8 Correct 15 ms 22104 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 9 ms 22108 KB Output is correct
11 Correct 25 ms 23132 KB Output is correct
12 Correct 30 ms 22992 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 22 ms 22968 KB Output is correct
15 Correct 1 ms 1624 KB Output is correct
16 Correct 174 ms 23236 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 176 ms 23284 KB Output is correct
19 Correct 16 ms 22108 KB Output is correct
20 Correct 12 ms 23008 KB Output is correct
21 Correct 23 ms 23208 KB Output is correct
22 Correct 13 ms 22104 KB Output is correct
23 Correct 1692 ms 23772 KB Output is correct
24 Correct 14 ms 22108 KB Output is correct
25 Execution timed out 3093 ms 23900 KB Time limit exceeded
26 Halted 0 ms 0 KB -