oj.uz

답안 #567326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567326 2022-05-23T10:32:49 Z SavicS Political Development (BOI17_politicaldevelopment) C++17
27 / 100
 1623 ms 42356 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n, K;

vector<int> g[mxN];
int deg[mxN];

bool los[mxN];

int dp[(1 << 10)];
int msk[(1 << 10)];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> K; 

    map<pii,bool> ima;
    ff(i,1,n){
        int len;
        cin >> len;
        ff(j,1,len){
            int X;
            cin >> X; X++;
            g[i].pb(X); deg[i] += 1;
            ima[{i, X}] = ima[{X, i}] = 1;
        }
    }

    set<pii> s;
    ff(i,1,n)s.insert({deg[i], i});

    int rez = 0;
    while(sz(s)){
        pii X = *s.begin(); s.erase(X); los[X.se] = 1;

        vector<int> vec; vec.pb(X.se);
        for(auto c : g[X.se]){
            if(los[c] == 0){
                vec.pb(c);
            }
        }

        int L = sz(vec); assert(L <= 10);

        ff(i,0,L - 1){
            msk[(1 << i)] = (1 << i);
            ff(j,0,L - 1){
                if(ima.count({vec[i], vec[j]}) == 1){
                    msk[(1 << i)] |= (1 << j);
                }
            }
        }

        dp[0] = (1 << L) - 1;
        ff(mask,1,(1 << L) - 1){
            int j = mask & (-mask);
            dp[mask] = dp[mask ^ j] & msk[j];
        }        

        ff(mask,1,(1 << L) - 1){
            if((dp[mask] & mask) == mask){
                rez = max(rez, __builtin_popcount(mask));
            }
        }

        ff(i,0,L - 1){
            s.erase({deg[vec[i]], vec[i]});
            deg[vec[i]] -= 1;
            if(deg[vec[i]] > 0)s.insert({deg[vec[i]], vec[i]});
        }

    }

    cout << rez << '\n';

    return 0;
}
/*

5 3
2 1 2
3 0 2 3
3 0 1 4
2 1 4
2 2 3

// probati bojenje sahovski
*/

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 16 ms 6060 KB Output is correct
4 Correct 11 ms 6100 KB Output is correct
5 Correct 10 ms 6168 KB Output is correct
6 Correct 13 ms 6184 KB Output is correct
7 Correct 13 ms 6072 KB Output is correct
8 Correct 5 ms 5296 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 16 ms 6060 KB Output is correct
4 Correct 11 ms 6100 KB Output is correct
5 Correct 10 ms 6168 KB Output is correct
6 Correct 13 ms 6184 KB Output is correct
7 Correct 13 ms 6072 KB Output is correct
8 Correct 5 ms 5296 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 11 ms 6168 KB Output is correct
12 Correct 11 ms 6140 KB Output is correct
13 Correct 3 ms 4932 KB Output is correct
14 Correct 12 ms 6100 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 14 ms 6112 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 13 ms 6076 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 9 ms 5716 KB Output is correct
21 Correct 8 ms 5808 KB Output is correct
22 Correct 6 ms 5204 KB Output is correct
23 Correct 19 ms 6308 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 18 ms 6328 KB Output is correct
26 Correct 19 ms 6212 KB Output is correct
27 Correct 16 ms 6144 KB Output is correct
28 Correct 19 ms 6104 KB Output is correct
29 Correct 18 ms 6120 KB Output is correct
30 Runtime error 22 ms 12708 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5264 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5028 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 1513 ms 42356 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 1595 ms 42356 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 1510 ms 42356 KB Output is correct
16 Correct 1517 ms 42348 KB Output is correct
17 Correct 1623 ms 42352 KB Output is correct
18 Correct 1513 ms 42352 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 16 ms 6060 KB Output is correct
4 Correct 11 ms 6100 KB Output is correct
5 Correct 10 ms 6168 KB Output is correct
6 Correct 13 ms 6184 KB Output is correct
7 Correct 13 ms 6072 KB Output is correct
8 Correct 5 ms 5296 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 11 ms 6168 KB Output is correct
12 Correct 11 ms 6140 KB Output is correct
13 Correct 3 ms 4932 KB Output is correct
14 Correct 12 ms 6100 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 14 ms 6112 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 13 ms 6076 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 9 ms 5716 KB Output is correct
21 Correct 8 ms 5808 KB Output is correct
22 Correct 6 ms 5204 KB Output is correct
23 Correct 19 ms 6308 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 18 ms 6328 KB Output is correct
26 Correct 19 ms 6212 KB Output is correct
27 Correct 16 ms 6144 KB Output is correct
28 Correct 19 ms 6104 KB Output is correct
29 Correct 18 ms 6120 KB Output is correct
30 Runtime error 22 ms 12708 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 16 ms 6060 KB Output is correct
4 Correct 11 ms 6100 KB Output is correct
5 Correct 10 ms 6168 KB Output is correct
6 Correct 13 ms 6184 KB Output is correct
7 Correct 13 ms 6072 KB Output is correct
8 Correct 5 ms 5296 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 11 ms 6168 KB Output is correct
12 Correct 11 ms 6140 KB Output is correct
13 Correct 3 ms 4932 KB Output is correct
14 Correct 12 ms 6100 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 14 ms 6112 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 13 ms 6076 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 9 ms 5716 KB Output is correct
21 Correct 8 ms 5808 KB Output is correct
22 Correct 6 ms 5204 KB Output is correct
23 Correct 19 ms 6308 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 18 ms 6328 KB Output is correct
26 Correct 19 ms 6212 KB Output is correct
27 Correct 16 ms 6144 KB Output is correct
28 Correct 19 ms 6104 KB Output is correct
29 Correct 18 ms 6120 KB Output is correct
30 Runtime error 22 ms 12708 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -