oj.uz

Submission #719367

# Submission time Handle Problem Language Result Execution time Memory
719367 2023-04-05T21:03:16 Z n0sk1ll Political Development (BOI17_politicaldevelopment) C++14
39 / 100
 313 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 (((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 2 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 6 ms 5628 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 7 ms 5672 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 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 2 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 6 ms 5628 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 7 ms 5672 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 6 ms 5716 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 7 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 7 ms 5732 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5504 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 8 ms 5848 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 9 ms 5852 KB Output is correct
26 Correct 8 ms 5800 KB Output is correct
27 Correct 6 ms 5716 KB Output is correct
28 Correct 7 ms 5800 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 8 ms 5844 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 5460 KB Output is correct
37 Correct 6 ms 5332 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct
39 Correct 4 ms 5308 KB Output is correct
40 Correct 11 ms 6100 KB Output is correct
41 Correct 4 ms 5312 KB Output is correct
42 Correct 12 ms 6100 KB Output is correct
43 Correct 11 ms 6204 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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 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 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 309 ms 28492 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 302 ms 28492 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 313 ms 28500 KB Output is correct
16 Correct 296 ms 28496 KB Output is correct
17 Correct 309 ms 28492 KB Output is correct
18 Correct 302 ms 28496 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 6 ms 5628 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 7 ms 5672 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 6 ms 5716 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 7 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 7 ms 5732 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5504 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 8 ms 5848 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 9 ms 5852 KB Output is correct
26 Correct 8 ms 5800 KB Output is correct
27 Correct 6 ms 5716 KB Output is correct
28 Correct 7 ms 5800 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 8 ms 5844 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 5460 KB Output is correct
37 Correct 6 ms 5332 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct
39 Correct 4 ms 5308 KB Output is correct
40 Correct 11 ms 6100 KB Output is correct
41 Correct 4 ms 5312 KB Output is correct
42 Correct 12 ms 6100 KB Output is correct
43 Correct 11 ms 6204 KB Output is correct
44 Correct 34 ms 7128 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 12 ms 6200 KB Output is correct
47 Correct 22 ms 7124 KB Output is correct
48 Correct 12 ms 6132 KB Output is correct
49 Correct 22 ms 7144 KB Output is correct
50 Correct 30 ms 6996 KB Output is correct
51 Correct 62 ms 8916 KB Output is correct
52 Correct 7 ms 5716 KB Output is correct
53 Correct 96 ms 9476 KB Output is correct
54 Correct 89 ms 9436 KB Output is correct
55 Correct 7 ms 5716 KB Output is correct
56 Correct 7 ms 5716 KB Output is correct
57 Correct 4 ms 5204 KB Output is correct
58 Correct 88 ms 9428 KB Output is correct
59 Correct 16 ms 6200 KB Output is correct
60 Correct 7 ms 5640 KB Output is correct
61 Correct 16 ms 6100 KB Output is correct
62 Correct 16 ms 6100 KB Output is correct
63 Correct 24 ms 7068 KB Output is correct
64 Correct 18 ms 6908 KB Output is correct
65 Correct 12 ms 5972 KB Output is correct
66 Correct 10 ms 6176 KB Output is correct
67 Correct 29 ms 7508 KB Output is correct
68 Correct 18 ms 6868 KB Output is correct
69 Correct 11 ms 5972 KB Output is correct
70 Correct 22 ms 6868 KB Output is correct
71 Correct 28 ms 7380 KB Output is correct
72 Correct 26 ms 7380 KB Output is correct
73 Correct 7 ms 5740 KB Output is correct
74 Correct 20 ms 6972 KB Output is correct
75 Correct 26 ms 7380 KB Output is correct
76 Correct 22 ms 6512 KB Output is correct
77 Correct 36 ms 7944 KB Output is correct
78 Correct 8 ms 5616 KB Output is correct
79 Correct 19 ms 6496 KB Output is correct
80 Correct 16 ms 6520 KB Output is correct
81 Correct 38 ms 7892 KB Output is correct
82 Correct 7 ms 5204 KB Output is correct
83 Correct 22 ms 6416 KB Output is correct
84 Correct 30 ms 7336 KB Output is correct
85 Correct 5 ms 5204 KB Output is correct
86 Incorrect 28 ms 7360 KB Output isn't correct
87 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 7 ms 5716 KB Output is correct
4 Correct 6 ms 5628 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 7 ms 5672 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 7 ms 5716 KB Output is correct
12 Correct 6 ms 5716 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 7 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 7 ms 5732 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5504 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 8 ms 5848 KB Output is correct
24 Correct 4 ms 5204 KB Output is correct
25 Correct 9 ms 5852 KB Output is correct
26 Correct 8 ms 5800 KB Output is correct
27 Correct 6 ms 5716 KB Output is correct
28 Correct 7 ms 5800 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 8 ms 5844 KB Output is correct
31 Correct 8 ms 5844 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 5460 KB Output is correct
37 Correct 6 ms 5332 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct
39 Correct 4 ms 5308 KB Output is correct
40 Correct 11 ms 6100 KB Output is correct
41 Correct 4 ms 5312 KB Output is correct
42 Correct 12 ms 6100 KB Output is correct
43 Correct 11 ms 6204 KB Output is correct
44 Correct 5 ms 4948 KB Output is correct
45 Correct 279 ms 21452 KB Output is correct
46 Correct 127 ms 14352 KB Output is correct
47 Correct 225 ms 21472 KB Output is correct
48 Correct 211 ms 21388 KB Output is correct
49 Correct 72 ms 12052 KB Output is correct
50 Correct 288 ms 26132 KB Output is correct
51 Correct 210 ms 21392 KB Output is correct
52 Correct 85 ms 12108 KB Output is correct
53 Correct 62 ms 11980 KB Output is correct
54 Correct 27 ms 7328 KB Output is correct
55 Correct 240 ms 26052 KB Output is correct
56 Correct 42 ms 9708 KB Output is correct
57 Correct 55 ms 12024 KB Output is correct
58 Correct 84 ms 14408 KB Output is correct
59 Correct 36 ms 9684 KB Output is correct
60 Correct 38 ms 9684 KB Output is correct
61 Correct 86 ms 14396 KB Output is correct
62 Correct 64 ms 12056 KB Output is correct
63 Correct 144 ms 15476 KB Output is correct
64 Correct 45 ms 9720 KB Output is correct
65 Correct 160 ms 18024 KB Output is correct
66 Correct 53 ms 12068 KB Output is correct
67 Correct 113 ms 15572 KB Output is correct
68 Correct 131 ms 17284 KB Output is correct
69 Correct 150 ms 17932 KB Output is correct
70 Correct 58 ms 12060 KB Output is correct
71 Correct 139 ms 17332 KB Output is correct
72 Correct 103 ms 15168 KB Output is correct
73 Correct 149 ms 19416 KB Output is correct
74 Correct 55 ms 12052 KB Output is correct
75 Correct 53 ms 10764 KB Output is correct
76 Correct 106 ms 15188 KB Output is correct
77 Correct 170 ms 19368 KB Output is correct
78 Correct 75 ms 12100 KB Output is correct
79 Correct 56 ms 10708 KB Output is correct
80 Correct 25 ms 7924 KB Output is correct
81 Correct 73 ms 12240 KB Output is correct
82 Correct 126 ms 16720 KB Output is correct
83 Correct 24 ms 7920 KB Output is correct
84 Incorrect 120 ms 16684 KB Output isn't correct
85 Halted 0 ms 0 KB -