oj.uz

Submission #719365

# Submission time Handle Problem Language Result Execution time Memory
719365 2023-04-05T21:01:56 Z n0sk1ll Political Development (BOI17_politicaldevelopment) C++14
39 / 100
 463 ms 31312 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);
            idemo[x].insert(i);
        }
    }
    ff(i,0,n) pq.insert({(int)idemo[i].size(),i});

    int ans=0;
    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 8 ms 5716 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 8 ms 5716 KB Output is correct
6 Correct 9 ms 5716 KB Output is correct
7 Correct 8 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 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 3 ms 4948 KB Output is correct
3 Correct 8 ms 5716 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 8 ms 5716 KB Output is correct
6 Correct 9 ms 5716 KB Output is correct
7 Correct 8 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 4 ms 5204 KB Output is correct
11 Correct 8 ms 5716 KB Output is correct
12 Correct 7 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 8 ms 5632 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 5 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 5856 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5736 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 9 ms 5884 KB Output is correct
31 Correct 10 ms 5972 KB Output is correct
32 Correct 9 ms 5844 KB Output is correct
33 Correct 9 ms 5844 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 5 ms 5332 KB Output is correct
36 Correct 6 ms 5332 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5316 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 13 ms 6100 KB Output is correct
41 Correct 4 ms 5204 KB Output is correct
42 Correct 13 ms 6100 KB Output is correct
43 Correct 12 ms 6100 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 2 ms 4948 KB Output is correct
5 Correct 3 ms 5004 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 445 ms 28560 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 450 ms 31140 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 458 ms 31092 KB Output is correct
16 Correct 437 ms 31052 KB Output is correct
17 Correct 463 ms 31312 KB Output is correct
18 Correct 452 ms 31204 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 3 ms 4948 KB Output is correct
3 Correct 8 ms 5716 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 8 ms 5716 KB Output is correct
6 Correct 9 ms 5716 KB Output is correct
7 Correct 8 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 4 ms 5204 KB Output is correct
11 Correct 8 ms 5716 KB Output is correct
12 Correct 7 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 8 ms 5632 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 5 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 5856 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5736 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 9 ms 5884 KB Output is correct
31 Correct 10 ms 5972 KB Output is correct
32 Correct 9 ms 5844 KB Output is correct
33 Correct 9 ms 5844 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 5 ms 5332 KB Output is correct
36 Correct 6 ms 5332 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5316 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 13 ms 6100 KB Output is correct
41 Correct 4 ms 5204 KB Output is correct
42 Correct 13 ms 6100 KB Output is correct
43 Correct 12 ms 6100 KB Output is correct
44 Correct 24 ms 7256 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 13 ms 6316 KB Output is correct
47 Correct 25 ms 7252 KB Output is correct
48 Correct 13 ms 6216 KB Output is correct
49 Correct 26 ms 7344 KB Output is correct
50 Correct 24 ms 7252 KB Output is correct
51 Correct 71 ms 9320 KB Output is correct
52 Correct 7 ms 5716 KB Output is correct
53 Correct 95 ms 9892 KB Output is correct
54 Correct 110 ms 10024 KB Output is correct
55 Correct 8 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 94 ms 9964 KB Output is correct
59 Correct 11 ms 6228 KB Output is correct
60 Correct 8 ms 5716 KB Output is correct
61 Correct 11 ms 6240 KB Output is correct
62 Correct 10 ms 6296 KB Output is correct
63 Correct 31 ms 7332 KB Output is correct
64 Correct 24 ms 7084 KB Output is correct
65 Correct 12 ms 6068 KB Output is correct
66 Correct 10 ms 6192 KB Output is correct
67 Correct 32 ms 7764 KB Output is correct
68 Correct 19 ms 6996 KB Output is correct
69 Correct 11 ms 6100 KB Output is correct
70 Correct 22 ms 7124 KB Output is correct
71 Correct 34 ms 7724 KB Output is correct
72 Correct 29 ms 7636 KB Output is correct
73 Correct 9 ms 5716 KB Output is correct
74 Correct 21 ms 7160 KB Output is correct
75 Correct 30 ms 7596 KB Output is correct
76 Correct 18 ms 6704 KB Output is correct
77 Correct 40 ms 8144 KB Output is correct
78 Correct 7 ms 5716 KB Output is correct
79 Correct 21 ms 6576 KB Output is correct
80 Correct 16 ms 6612 KB Output is correct
81 Correct 41 ms 8232 KB Output is correct
82 Correct 5 ms 5296 KB Output is correct
83 Correct 21 ms 6548 KB Output is correct
84 Correct 30 ms 7584 KB Output is correct
85 Correct 5 ms 5332 KB Output is correct
86 Incorrect 30 ms 7580 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 3 ms 4948 KB Output is correct
3 Correct 8 ms 5716 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 8 ms 5716 KB Output is correct
6 Correct 9 ms 5716 KB Output is correct
7 Correct 8 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 4 ms 5204 KB Output is correct
11 Correct 8 ms 5716 KB Output is correct
12 Correct 7 ms 5716 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 8 ms 5632 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 5 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 5856 KB Output is correct
26 Correct 9 ms 5716 KB Output is correct
27 Correct 7 ms 5736 KB Output is correct
28 Correct 8 ms 5716 KB Output is correct
29 Correct 7 ms 5716 KB Output is correct
30 Correct 9 ms 5884 KB Output is correct
31 Correct 10 ms 5972 KB Output is correct
32 Correct 9 ms 5844 KB Output is correct
33 Correct 9 ms 5844 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 5 ms 5332 KB Output is correct
36 Correct 6 ms 5332 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5316 KB Output is correct
39 Correct 5 ms 5204 KB Output is correct
40 Correct 13 ms 6100 KB Output is correct
41 Correct 4 ms 5204 KB Output is correct
42 Correct 13 ms 6100 KB Output is correct
43 Correct 12 ms 6100 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 275 ms 21448 KB Output is correct
46 Correct 106 ms 14408 KB Output is correct
47 Correct 281 ms 21508 KB Output is correct
48 Correct 281 ms 21448 KB Output is correct
49 Correct 74 ms 12004 KB Output is correct
50 Correct 293 ms 26252 KB Output is correct
51 Correct 256 ms 21336 KB Output is correct
52 Correct 68 ms 11964 KB Output is correct
53 Correct 77 ms 11976 KB Output is correct
54 Correct 19 ms 7252 KB Output is correct
55 Correct 307 ms 26176 KB Output is correct
56 Correct 35 ms 9684 KB Output is correct
57 Correct 68 ms 12056 KB Output is correct
58 Correct 79 ms 14284 KB Output is correct
59 Correct 39 ms 9712 KB Output is correct
60 Correct 36 ms 9608 KB Output is correct
61 Correct 83 ms 14528 KB Output is correct
62 Correct 57 ms 11956 KB Output is correct
63 Correct 140 ms 15692 KB Output is correct
64 Correct 35 ms 9692 KB Output is correct
65 Correct 187 ms 17896 KB Output is correct
66 Correct 56 ms 11988 KB Output is correct
67 Correct 134 ms 15584 KB Output is correct
68 Correct 168 ms 17228 KB Output is correct
69 Correct 186 ms 17924 KB Output is correct
70 Correct 69 ms 11980 KB Output is correct
71 Correct 176 ms 17360 KB Output is correct
72 Correct 128 ms 15080 KB Output is correct
73 Correct 200 ms 19416 KB Output is correct
74 Correct 68 ms 11996 KB Output is correct
75 Correct 61 ms 10724 KB Output is correct
76 Correct 130 ms 15120 KB Output is correct
77 Correct 214 ms 19504 KB Output is correct
78 Correct 84 ms 12108 KB Output is correct
79 Correct 62 ms 10748 KB Output is correct
80 Correct 29 ms 8020 KB Output is correct
81 Correct 90 ms 12252 KB Output is correct
82 Correct 153 ms 16656 KB Output is correct
83 Correct 33 ms 7904 KB Output is correct
84 Incorrect 157 ms 16712 KB Output isn't correct
85 Halted 0 ms 0 KB -