oj.uz

Submission #719378

# Submission time Handle Problem Language Result Execution time Memory
719378 2023-04-05T21:13:01 Z n0sk1ll Political Development (BOI17_politicaldevelopment) C++14
100 / 100
 404 ms 28500 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

struct find_clique
{
    int g[102]; //graph by bitmask
    int dp1[3500]; //first half
    int pc[3500]; //precalced
    int dp2[3500]; //second half

    void clear(int n)
    {
        ff(i,0,n) g[i]=0;
        ff(i,0,(1<<n)) dp1[i]=0;
        ff(i,0,(1<<n)) dp2[i]=0;
    }

    void add(int u, int v)
    {
        g[u]|=(1<<v);
        g[v]|=(1<<u);
    }

    /*int calc(int n)
    {

        int fh=n/2,sh=(n+1)/2,fb=(1<<fh)-1,sb=(1<<sh)-1;
        ff(i,0,(1<<sh)) pc[i]=__builtin_popcount(i);

        ff(mask,1,(1<<fh)) ff(j,0,fh) if (mask&(1<<j)) {
            dp1[mask]=max(dp1[mask],dp1[mask&g[j]]+1);
        }

        ff(mask,1,(1<<sh)) ff(j,0,sh) if (mask&(1<<j)) {
            dp2[mask]=max(dp2[mask],dp2[mask&(g[j]>>fh)]+1);
        }

        int ans=0;
        ff(mask,0,(1<<sh)) if (dp2[mask]==pc[mask])
        {
            int span=0;
            ff(j,0,sh) if (mask&(1<<j)) span|=(g[j]&fb);
            ans=max(ans,pc[mask]+dp1[span]);
        }

        return ans;
    }*/

    int calc(int n)
    {
        int ans=0;
        ff(mask,0,(1<<n))
        {
            bool dobar=true;
            ff(j,0,n) if (mask&(1<<j)) if (((g[j]|(1<<j))&mask)!=mask) dobar=false;
            if (dobar) ans=max(ans,__builtin_popcount(mask));
        }
        return ans;
    }
} ok;

set<pii> pq;
set<int> idemo[100005];

int main()
{
    FAST;

    int n,k; cin>>n>>k;
    ff(i,0,n)
    {
        int d; cin>>d;
        while (d--)
        {
            int x; cin>>x;
            idemo[i].insert(x);
        }
    }
    ff(i,0,n) pq.insert({(int)idemo[i].size(),i});

    int ans=1;
    while (!pq.empty())
    {
        int p=pq.begin()->yy;

        vector<int> cvors;
        cvors.pb(p);

        for (auto it : idemo[p]) cvors.pb(it);

        /*cout<<"consider: ";
        for (auto it : cvors) cout<<it<<" "; cout<<endl;*/

        ok.clear((int)cvors.size());
        ff(i,0,(int)cvors.size())
            ff(j,i+1,(int)cvors.size())
                if (idemo[cvors[i]].count(cvors[j]))
                    ok.add(i,j);

        ans=max(ans,ok.calc((int)cvors.size()));

        for (auto it : idemo[p]) pq.erase({(int)idemo[it].size(),it}),idemo[it].erase(p),pq.insert({(int)idemo[it].size(),it});
        pq.erase({(int)idemo[p].size(),p});
    }

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

//Note to self: Check for overflow

/*

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

*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 7 ms 5680 KB Output is correct
5 Correct 7 ms 5736 KB Output is correct
6 Correct 7 ms 5736 KB Output is correct
7 Correct 7 ms 5716 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 6 ms 5156 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 7 ms 5680 KB Output is correct
5 Correct 7 ms 5736 KB Output is correct
6 Correct 7 ms 5736 KB Output is correct
7 Correct 7 ms 5716 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 6 ms 5156 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 8 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 10 ms 5716 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 7 ms 5716 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 8 ms 5716 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5460 KB Output is correct
21 Correct 6 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 9 ms 5844 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 10 ms 5844 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5716 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 9 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 9 ms 5892 KB Output is correct
32 Correct 8 ms 5844 KB Output is correct
33 Correct 9 ms 5888 KB Output is correct
34 Correct 10 ms 5844 KB Output is correct
35 Correct 5 ms 5460 KB Output is correct
36 Correct 5 ms 5348 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 4 ms 5276 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 12 ms 6208 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 13 ms 6196 KB Output is correct
43 Correct 12 ms 6268 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5204 KB Output is correct
2 Correct 3 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 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 350 ms 28492 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 404 ms 28496 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 390 ms 28492 KB Output is correct
16 Correct 373 ms 28492 KB Output is correct
17 Correct 367 ms 28500 KB Output is correct
18 Correct 353 ms 28496 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 7 ms 5680 KB Output is correct
5 Correct 7 ms 5736 KB Output is correct
6 Correct 7 ms 5736 KB Output is correct
7 Correct 7 ms 5716 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 6 ms 5156 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 8 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 10 ms 5716 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 7 ms 5716 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 8 ms 5716 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5460 KB Output is correct
21 Correct 6 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 9 ms 5844 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 10 ms 5844 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5716 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 9 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 9 ms 5892 KB Output is correct
32 Correct 8 ms 5844 KB Output is correct
33 Correct 9 ms 5888 KB Output is correct
34 Correct 10 ms 5844 KB Output is correct
35 Correct 5 ms 5460 KB Output is correct
36 Correct 5 ms 5348 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 4 ms 5276 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 12 ms 6208 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 13 ms 6196 KB Output is correct
43 Correct 12 ms 6268 KB Output is correct
44 Correct 37 ms 7124 KB Output is correct
45 Correct 3 ms 5012 KB Output is correct
46 Correct 15 ms 6204 KB Output is correct
47 Correct 22 ms 7124 KB Output is correct
48 Correct 12 ms 6100 KB Output is correct
49 Correct 23 ms 7056 KB Output is correct
50 Correct 22 ms 6996 KB Output is correct
51 Correct 108 ms 9000 KB Output is correct
52 Correct 7 ms 5716 KB Output is correct
53 Correct 214 ms 9476 KB Output is correct
54 Correct 216 ms 9476 KB Output is correct
55 Correct 8 ms 5736 KB Output is correct
56 Correct 7 ms 5716 KB Output is correct
57 Correct 4 ms 5264 KB Output is correct
58 Correct 207 ms 9428 KB Output is correct
59 Correct 10 ms 6204 KB Output is correct
60 Correct 7 ms 5716 KB Output is correct
61 Correct 11 ms 6100 KB Output is correct
62 Correct 11 ms 6100 KB Output is correct
63 Correct 35 ms 7124 KB Output is correct
64 Correct 24 ms 6880 KB Output is correct
65 Correct 11 ms 5972 KB Output is correct
66 Correct 10 ms 6204 KB Output is correct
67 Correct 36 ms 7516 KB Output is correct
68 Correct 22 ms 6868 KB Output is correct
69 Correct 11 ms 5972 KB Output is correct
70 Correct 23 ms 6868 KB Output is correct
71 Correct 34 ms 7400 KB Output is correct
72 Correct 32 ms 7412 KB Output is correct
73 Correct 7 ms 5644 KB Output is correct
74 Correct 21 ms 6980 KB Output is correct
75 Correct 34 ms 7332 KB Output is correct
76 Correct 17 ms 6484 KB Output is correct
77 Correct 53 ms 7944 KB Output is correct
78 Correct 7 ms 5716 KB Output is correct
79 Correct 26 ms 6504 KB Output is correct
80 Correct 14 ms 6484 KB Output is correct
81 Correct 49 ms 7940 KB Output is correct
82 Correct 4 ms 5316 KB Output is correct
83 Correct 27 ms 6484 KB Output is correct
84 Correct 29 ms 7252 KB Output is correct
85 Correct 4 ms 5312 KB Output is correct
86 Correct 37 ms 7356 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 7 ms 5680 KB Output is correct
5 Correct 7 ms 5736 KB Output is correct
6 Correct 7 ms 5736 KB Output is correct
7 Correct 7 ms 5716 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 6 ms 5156 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 8 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 10 ms 5716 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 7 ms 5716 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 8 ms 5716 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5460 KB Output is correct
21 Correct 6 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 9 ms 5844 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 10 ms 5844 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5716 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 9 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 9 ms 5892 KB Output is correct
32 Correct 8 ms 5844 KB Output is correct
33 Correct 9 ms 5888 KB Output is correct
34 Correct 10 ms 5844 KB Output is correct
35 Correct 5 ms 5460 KB Output is correct
36 Correct 5 ms 5348 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 4 ms 5276 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 12 ms 6208 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 13 ms 6196 KB Output is correct
43 Correct 12 ms 6268 KB Output is correct
44 Correct 4 ms 4948 KB Output is correct
45 Correct 217 ms 21396 KB Output is correct
46 Correct 91 ms 14404 KB Output is correct
47 Correct 200 ms 21468 KB Output is correct
48 Correct 231 ms 21452 KB Output is correct
49 Correct 60 ms 12016 KB Output is correct
50 Correct 207 ms 26148 KB Output is correct
51 Correct 204 ms 21380 KB Output is correct
52 Correct 57 ms 12056 KB Output is correct
53 Correct 59 ms 11956 KB Output is correct
54 Correct 19 ms 7372 KB Output is correct
55 Correct 245 ms 26152 KB Output is correct
56 Correct 36 ms 9728 KB Output is correct
57 Correct 56 ms 11956 KB Output is correct
58 Correct 73 ms 14404 KB Output is correct
59 Correct 36 ms 9708 KB Output is correct
60 Correct 35 ms 9684 KB Output is correct
61 Correct 75 ms 14408 KB Output is correct
62 Correct 59 ms 12052 KB Output is correct
63 Correct 114 ms 15588 KB Output is correct
64 Correct 37 ms 9684 KB Output is correct
65 Correct 160 ms 17940 KB Output is correct
66 Correct 72 ms 11980 KB Output is correct
67 Correct 111 ms 15572 KB Output is correct
68 Correct 139 ms 17324 KB Output is correct
69 Correct 183 ms 17928 KB Output is correct
70 Correct 57 ms 11988 KB Output is correct
71 Correct 136 ms 17360 KB Output is correct
72 Correct 108 ms 15088 KB Output is correct
73 Correct 201 ms 19404 KB Output is correct
74 Correct 58 ms 12060 KB Output is correct
75 Correct 55 ms 10776 KB Output is correct
76 Correct 114 ms 15188 KB Output is correct
77 Correct 160 ms 19436 KB Output is correct
78 Correct 71 ms 12220 KB Output is correct
79 Correct 55 ms 10756 KB Output is correct
80 Correct 29 ms 7892 KB Output is correct
81 Correct 75 ms 12216 KB Output is correct
82 Correct 130 ms 16844 KB Output is correct
83 Correct 28 ms 7924 KB Output is correct
84 Correct 119 ms 16760 KB Output is correct