oj.uz

Submission #719364

# Submission time Handle Problem Language Result Execution time Memory
719364 2023-04-05T21:00:59 Z n0sk1ll Political Development (BOI17_politicaldevelopment) C++14
16 / 100
 444 ms 60196 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[12]; //graph by bitmask
    int dp1[35]; //first half
    int pc[35]; //precalced
    int dp2[35]; //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 3 ms 5076 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 9 ms 5756 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 9 ms 5672 KB Output is correct
6 Correct 8 ms 5716 KB Output is correct
7 Correct 8 ms 5716 KB Output is correct
8 Correct 5 ms 5156 KB Output is correct
9 Correct 3 ms 5020 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 3 ms 5076 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 9 ms 5756 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 9 ms 5672 KB Output is correct
6 Correct 8 ms 5716 KB Output is correct
7 Correct 8 ms 5716 KB Output is correct
8 Correct 5 ms 5156 KB Output is correct
9 Correct 3 ms 5020 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 5672 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 11 ms 5716 KB Output is correct
15 Correct 3 ms 5020 KB Output is correct
16 Correct 10 ms 5716 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 9 ms 5784 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 6 ms 5416 KB Output is correct
21 Correct 6 ms 5416 KB Output is correct
22 Correct 5 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 9 ms 5860 KB Output is correct
26 Correct 8 ms 5844 KB Output is correct
27 Correct 7 ms 5676 KB Output is correct
28 Correct 9 ms 5852 KB Output is correct
29 Correct 8 ms 5716 KB Output is correct
30 Correct 10 ms 5844 KB Output is correct
31 Correct 10 ms 5928 KB Output is correct
32 Correct 10 ms 5928 KB Output is correct
33 Correct 9 ms 5948 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 6 ms 5460 KB Output is correct
36 Correct 7 ms 5460 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5288 KB Output is correct
39 Correct 6 ms 5304 KB Output is correct
40 Correct 13 ms 6228 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 12 ms 6296 KB Output is correct
43 Correct 13 ms 6228 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5204 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5016 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4936 KB Output is correct
9 Correct 2 ms 5016 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Runtime error 444 ms 60196 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 9 ms 5756 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 9 ms 5672 KB Output is correct
6 Correct 8 ms 5716 KB Output is correct
7 Correct 8 ms 5716 KB Output is correct
8 Correct 5 ms 5156 KB Output is correct
9 Correct 3 ms 5020 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 5672 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 11 ms 5716 KB Output is correct
15 Correct 3 ms 5020 KB Output is correct
16 Correct 10 ms 5716 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 9 ms 5784 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 6 ms 5416 KB Output is correct
21 Correct 6 ms 5416 KB Output is correct
22 Correct 5 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 9 ms 5860 KB Output is correct
26 Correct 8 ms 5844 KB Output is correct
27 Correct 7 ms 5676 KB Output is correct
28 Correct 9 ms 5852 KB Output is correct
29 Correct 8 ms 5716 KB Output is correct
30 Correct 10 ms 5844 KB Output is correct
31 Correct 10 ms 5928 KB Output is correct
32 Correct 10 ms 5928 KB Output is correct
33 Correct 9 ms 5948 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 6 ms 5460 KB Output is correct
36 Correct 7 ms 5460 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5288 KB Output is correct
39 Correct 6 ms 5304 KB Output is correct
40 Correct 13 ms 6228 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 12 ms 6296 KB Output is correct
43 Correct 13 ms 6228 KB Output is correct
44 Runtime error 31 ms 14372 KB Execution killed with signal 11
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 9 ms 5756 KB Output is correct
4 Correct 8 ms 5716 KB Output is correct
5 Correct 9 ms 5672 KB Output is correct
6 Correct 8 ms 5716 KB Output is correct
7 Correct 8 ms 5716 KB Output is correct
8 Correct 5 ms 5156 KB Output is correct
9 Correct 3 ms 5020 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 5672 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 11 ms 5716 KB Output is correct
15 Correct 3 ms 5020 KB Output is correct
16 Correct 10 ms 5716 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 9 ms 5784 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 6 ms 5416 KB Output is correct
21 Correct 6 ms 5416 KB Output is correct
22 Correct 5 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 9 ms 5860 KB Output is correct
26 Correct 8 ms 5844 KB Output is correct
27 Correct 7 ms 5676 KB Output is correct
28 Correct 9 ms 5852 KB Output is correct
29 Correct 8 ms 5716 KB Output is correct
30 Correct 10 ms 5844 KB Output is correct
31 Correct 10 ms 5928 KB Output is correct
32 Correct 10 ms 5928 KB Output is correct
33 Correct 9 ms 5948 KB Output is correct
34 Correct 9 ms 5844 KB Output is correct
35 Correct 6 ms 5460 KB Output is correct
36 Correct 7 ms 5460 KB Output is correct
37 Correct 5 ms 5460 KB Output is correct
38 Correct 5 ms 5288 KB Output is correct
39 Correct 6 ms 5304 KB Output is correct
40 Correct 13 ms 6228 KB Output is correct
41 Correct 5 ms 5204 KB Output is correct
42 Correct 12 ms 6296 KB Output is correct
43 Correct 13 ms 6228 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 285 ms 23248 KB Output is correct
46 Correct 106 ms 15308 KB Output is correct
47 Correct 269 ms 23372 KB Output is correct
48 Correct 259 ms 23116 KB Output is correct
49 Correct 81 ms 12660 KB Output is correct
50 Correct 304 ms 28376 KB Output is correct
51 Correct 257 ms 23196 KB Output is correct
52 Correct 65 ms 12712 KB Output is correct
53 Correct 79 ms 12648 KB Output is correct
54 Correct 20 ms 7380 KB Output is correct
55 Correct 293 ms 28444 KB Output is correct
56 Correct 36 ms 10028 KB Output is correct
57 Correct 71 ms 12680 KB Output is correct
58 Correct 87 ms 15244 KB Output is correct
59 Correct 37 ms 10060 KB Output is correct
60 Correct 39 ms 10008 KB Output is correct
61 Correct 81 ms 15260 KB Output is correct
62 Correct 57 ms 12712 KB Output is correct
63 Correct 149 ms 16592 KB Output is correct
64 Correct 39 ms 10092 KB Output is correct
65 Correct 184 ms 19364 KB Output is correct
66 Correct 57 ms 12612 KB Output is correct
67 Correct 145 ms 16632 KB Output is correct
68 Correct 179 ms 18616 KB Output is correct
69 Correct 190 ms 19288 KB Output is correct
70 Correct 67 ms 12668 KB Output is correct
71 Correct 179 ms 18616 KB Output is correct
72 Correct 129 ms 16332 KB Output is correct
73 Correct 217 ms 20872 KB Output is correct
74 Correct 69 ms 12660 KB Output is correct
75 Correct 63 ms 11328 KB Output is correct
76 Correct 129 ms 16216 KB Output is correct
77 Correct 210 ms 21044 KB Output is correct
78 Correct 89 ms 12912 KB Output is correct
79 Correct 73 ms 11316 KB Output is correct
80 Correct 30 ms 8064 KB Output is correct
81 Correct 82 ms 12932 KB Output is correct
82 Correct 157 ms 18076 KB Output is correct
83 Correct 29 ms 8140 KB Output is correct
84 Incorrect 157 ms 17868 KB Output isn't correct
85 Halted 0 ms 0 KB -