oj.uz

답안 #381735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
381735 2021-03-25T19:39:05 Z b00n0rp Political Development (BOI17_politicaldevelopment) C++17
100 / 100
 505 ms 27528 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 50005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,k;
set<int> adj[MAXN];
int deg[MAXN];
int subdeg[11];
 
void solvethetestcase(){
    cin >> n >> k;
    set<pii> s;
    REP(i,n){
        cin >> deg[i];
        REP(j,deg[i]){
            int x; cin >> x;
            adj[i].insert(x);
        }
        s.insert({deg[i],i});
    }
    int ans = 1;
    REP(i,n){
        int u = (*s.begin()).S;
        s.erase(s.begin());
        REP(j,11) subdeg[j] = 0;
        vi v;
        for(auto x:adj[u]) v.pb(x);
        REP(j,deg[u]){
            subdeg[j] += (1<<j);
            FOR(jj,j+1,deg[u]){
                if(adj[v[j]].find(v[jj]) != adj[v[j]].end()){
                    subdeg[j] += (1<<jj);
                    subdeg[jj] += (1<<j);
                }
            }
        }
        REP(mask,(1<<deg[u])){
            if(__builtin_popcount(mask) < ans) continue;
            bool flag = 1;
            REP(j,deg[u]){
                if((1<<j)&mask){
                    if((mask&subdeg[j]) != mask){
                        flag = 0;
                        break;
                    }
                }
            }
            if(flag) remax(ans,__builtin_popcount(mask)+1LL);
        }
        for(auto x:v){
            s.erase({deg[x],x});
            adj[x].erase(u);
            deg[x]--;
            s.insert({deg[x],x});
        }
    }
    cout << ans << "\n";
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 8 ms 3564 KB Output is correct
4 Correct 7 ms 3564 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 8 ms 3564 KB Output is correct
7 Correct 8 ms 3564 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 4 ms 3052 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 8 ms 3564 KB Output is correct
4 Correct 7 ms 3564 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 8 ms 3564 KB Output is correct
7 Correct 8 ms 3564 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 4 ms 3052 KB Output is correct
11 Correct 9 ms 3564 KB Output is correct
12 Correct 8 ms 3564 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 7 ms 3564 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 8 ms 3564 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 9 ms 3564 KB Output is correct
19 Correct 4 ms 3052 KB Output is correct
20 Correct 5 ms 3308 KB Output is correct
21 Correct 5 ms 3308 KB Output is correct
22 Correct 4 ms 3052 KB Output is correct
23 Correct 9 ms 3564 KB Output is correct
24 Correct 4 ms 3052 KB Output is correct
25 Correct 10 ms 3692 KB Output is correct
26 Correct 9 ms 3692 KB Output is correct
27 Correct 8 ms 3564 KB Output is correct
28 Correct 9 ms 3712 KB Output is correct
29 Correct 7 ms 3564 KB Output is correct
30 Correct 9 ms 3692 KB Output is correct
31 Correct 9 ms 3692 KB Output is correct
32 Correct 9 ms 3692 KB Output is correct
33 Correct 9 ms 3692 KB Output is correct
34 Correct 9 ms 3692 KB Output is correct
35 Correct 6 ms 3180 KB Output is correct
36 Correct 6 ms 3180 KB Output is correct
37 Correct 6 ms 3180 KB Output is correct
38 Correct 6 ms 3052 KB Output is correct
39 Correct 5 ms 3052 KB Output is correct
40 Correct 13 ms 4076 KB Output is correct
41 Correct 5 ms 3052 KB Output is correct
42 Correct 13 ms 4076 KB Output is correct
43 Correct 13 ms 4076 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3052 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 486 ms 27372 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 505 ms 27404 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 455 ms 27500 KB Output is correct
16 Correct 447 ms 27372 KB Output is correct
17 Correct 450 ms 27500 KB Output is correct
18 Correct 488 ms 27372 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 8 ms 3564 KB Output is correct
4 Correct 7 ms 3564 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 8 ms 3564 KB Output is correct
7 Correct 8 ms 3564 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 4 ms 3052 KB Output is correct
11 Correct 9 ms 3564 KB Output is correct
12 Correct 8 ms 3564 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 7 ms 3564 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 8 ms 3564 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 9 ms 3564 KB Output is correct
19 Correct 4 ms 3052 KB Output is correct
20 Correct 5 ms 3308 KB Output is correct
21 Correct 5 ms 3308 KB Output is correct
22 Correct 4 ms 3052 KB Output is correct
23 Correct 9 ms 3564 KB Output is correct
24 Correct 4 ms 3052 KB Output is correct
25 Correct 10 ms 3692 KB Output is correct
26 Correct 9 ms 3692 KB Output is correct
27 Correct 8 ms 3564 KB Output is correct
28 Correct 9 ms 3712 KB Output is correct
29 Correct 7 ms 3564 KB Output is correct
30 Correct 9 ms 3692 KB Output is correct
31 Correct 9 ms 3692 KB Output is correct
32 Correct 9 ms 3692 KB Output is correct
33 Correct 9 ms 3692 KB Output is correct
34 Correct 9 ms 3692 KB Output is correct
35 Correct 6 ms 3180 KB Output is correct
36 Correct 6 ms 3180 KB Output is correct
37 Correct 6 ms 3180 KB Output is correct
38 Correct 6 ms 3052 KB Output is correct
39 Correct 5 ms 3052 KB Output is correct
40 Correct 13 ms 4076 KB Output is correct
41 Correct 5 ms 3052 KB Output is correct
42 Correct 13 ms 4076 KB Output is correct
43 Correct 13 ms 4076 KB Output is correct
44 Correct 20 ms 5100 KB Output is correct
45 Correct 3 ms 2668 KB Output is correct
46 Correct 13 ms 4076 KB Output is correct
47 Correct 24 ms 5100 KB Output is correct
48 Correct 19 ms 4076 KB Output is correct
49 Correct 25 ms 5100 KB Output is correct
50 Correct 26 ms 5100 KB Output is correct
51 Correct 60 ms 7276 KB Output is correct
52 Correct 8 ms 3564 KB Output is correct
53 Correct 63 ms 7660 KB Output is correct
54 Correct 77 ms 7660 KB Output is correct
55 Correct 8 ms 3564 KB Output is correct
56 Correct 8 ms 3564 KB Output is correct
57 Correct 4 ms 3052 KB Output is correct
58 Correct 61 ms 7660 KB Output is correct
59 Correct 11 ms 4076 KB Output is correct
60 Correct 8 ms 3564 KB Output is correct
61 Correct 11 ms 4076 KB Output is correct
62 Correct 11 ms 4076 KB Output is correct
63 Correct 19 ms 5100 KB Output is correct
64 Correct 17 ms 4844 KB Output is correct
65 Correct 12 ms 3948 KB Output is correct
66 Correct 11 ms 4076 KB Output is correct
67 Correct 29 ms 5484 KB Output is correct
68 Correct 17 ms 4844 KB Output is correct
69 Correct 12 ms 3948 KB Output is correct
70 Correct 23 ms 4844 KB Output is correct
71 Correct 29 ms 5484 KB Output is correct
72 Correct 29 ms 5484 KB Output is correct
73 Correct 9 ms 3564 KB Output is correct
74 Correct 23 ms 4972 KB Output is correct
75 Correct 29 ms 5484 KB Output is correct
76 Correct 17 ms 4460 KB Output is correct
77 Correct 41 ms 5996 KB Output is correct
78 Correct 8 ms 3564 KB Output is correct
79 Correct 19 ms 4332 KB Output is correct
80 Correct 18 ms 4608 KB Output is correct
81 Correct 41 ms 5960 KB Output is correct
82 Correct 5 ms 3052 KB Output is correct
83 Correct 19 ms 4332 KB Output is correct
84 Correct 29 ms 5356 KB Output is correct
85 Correct 5 ms 3052 KB Output is correct
86 Correct 27 ms 5356 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 8 ms 3564 KB Output is correct
4 Correct 7 ms 3564 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 8 ms 3564 KB Output is correct
7 Correct 8 ms 3564 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 4 ms 3052 KB Output is correct
11 Correct 9 ms 3564 KB Output is correct
12 Correct 8 ms 3564 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 7 ms 3564 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 8 ms 3564 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 9 ms 3564 KB Output is correct
19 Correct 4 ms 3052 KB Output is correct
20 Correct 5 ms 3308 KB Output is correct
21 Correct 5 ms 3308 KB Output is correct
22 Correct 4 ms 3052 KB Output is correct
23 Correct 9 ms 3564 KB Output is correct
24 Correct 4 ms 3052 KB Output is correct
25 Correct 10 ms 3692 KB Output is correct
26 Correct 9 ms 3692 KB Output is correct
27 Correct 8 ms 3564 KB Output is correct
28 Correct 9 ms 3712 KB Output is correct
29 Correct 7 ms 3564 KB Output is correct
30 Correct 9 ms 3692 KB Output is correct
31 Correct 9 ms 3692 KB Output is correct
32 Correct 9 ms 3692 KB Output is correct
33 Correct 9 ms 3692 KB Output is correct
34 Correct 9 ms 3692 KB Output is correct
35 Correct 6 ms 3180 KB Output is correct
36 Correct 6 ms 3180 KB Output is correct
37 Correct 6 ms 3180 KB Output is correct
38 Correct 6 ms 3052 KB Output is correct
39 Correct 5 ms 3052 KB Output is correct
40 Correct 13 ms 4076 KB Output is correct
41 Correct 5 ms 3052 KB Output is correct
42 Correct 13 ms 4076 KB Output is correct
43 Correct 13 ms 4076 KB Output is correct
44 Correct 3 ms 2668 KB Output is correct
45 Correct 288 ms 22252 KB Output is correct
46 Correct 114 ms 14316 KB Output is correct
47 Correct 286 ms 22252 KB Output is correct
48 Correct 315 ms 22252 KB Output is correct
49 Correct 69 ms 11628 KB Output is correct
50 Correct 266 ms 27528 KB Output is correct
51 Correct 297 ms 22252 KB Output is correct
52 Correct 66 ms 11628 KB Output is correct
53 Correct 76 ms 11628 KB Output is correct
54 Correct 20 ms 6376 KB Output is correct
55 Correct 265 ms 27500 KB Output is correct
56 Correct 40 ms 9068 KB Output is correct
57 Correct 65 ms 11544 KB Output is correct
58 Correct 82 ms 14208 KB Output is correct
59 Correct 43 ms 8940 KB Output is correct
60 Correct 45 ms 8940 KB Output is correct
61 Correct 83 ms 14188 KB Output is correct
62 Correct 69 ms 11628 KB Output is correct
63 Correct 161 ms 15596 KB Output is correct
64 Correct 45 ms 8940 KB Output is correct
65 Correct 206 ms 18156 KB Output is correct
66 Correct 63 ms 11628 KB Output is correct
67 Correct 160 ms 15724 KB Output is correct
68 Correct 190 ms 17516 KB Output is correct
69 Correct 202 ms 18156 KB Output is correct
70 Correct 75 ms 11628 KB Output is correct
71 Correct 195 ms 17644 KB Output is correct
72 Correct 141 ms 15328 KB Output is correct
73 Correct 222 ms 19820 KB Output is correct
74 Correct 77 ms 11628 KB Output is correct
75 Correct 69 ms 9684 KB Output is correct
76 Correct 145 ms 15084 KB Output is correct
77 Correct 249 ms 20032 KB Output is correct
78 Correct 102 ms 11244 KB Output is correct
79 Correct 72 ms 9708 KB Output is correct
80 Correct 30 ms 6124 KB Output is correct
81 Correct 98 ms 11244 KB Output is correct
82 Correct 182 ms 16876 KB Output is correct
83 Correct 29 ms 6124 KB Output is correct
84 Correct 177 ms 16876 KB Output is correct