oj.uz

답안 #135711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135711 2019-07-24T09:56:44 Z miguel Political Development (BOI17_politicaldevelopment) C++14
4 / 100
 3000 ms 30724 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
#define nmax 301
const ll mod = 998244353;
int n, m, k, viz[50001], deg[50001], ans;
vi g[50001];
set <pi> edg;
priority_queue<pi, vector<pi>, greater<pi>> pq;

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    //cin>>n;for(int i=1; i<=n; i++){int x; cin>>x; pq.push(x);};while(!pq.empty()){int x=pq.top(); pq.pop(); cout<<x<<" ";}
    cin>>n>>k;
    for(int i=0; i<n; i++){
        cin>>deg[i];
        pq.push({deg[i], i});
        for(int j=1; j<=deg[i]; j++){
            int x;
            cin>>x;
            g[i].pb(x);
            edg.insert({i, x});
        }
    }
    //for(pi i: edg){ cout<<i.x<<" "<<i.y<<"\n";}
    //cout<<"\n";
    while(true){
        //cout<<"xd"<<endl;
        while(!pq.empty() && viz[pq.top().x]) pq.pop();
        if(pq.empty()) break;
        int a=pq.top().y, d=pq.top().x;
        pq.pop();
        deg[a]=0;
        viz[a]=1;
        vi v={a};
        for(int i : g[a]){
            if(!viz[i]){
                deg[i]--;
                pq.push({deg[i], i});
                v.pb(i);
            }
        }
        //assert(v.size()<=10);
        //for(int i : v) cout<<i<<" "; cout<<endl;
        bool adj[5000][5000];
        for(int i=0; i<v.size(); i++){
            //a[i][j]=0;
            for(int j=0; j<v.size(); j++){
                if(i!=j && edg.find({v[i], v[j]})!=edg.end()){
                    adj[i][j]=1;
                }
                else adj[i][j]=0;
            }
        }
        for(int mask=1; mask<(1<<v.size()); mask+=2){
            bool ctrl=1;
            int cnt=0;
            for(int i=0; i<v.size(); i++){
                if((mask>>i)%2==0) continue;
                cnt++;
                for(int j=0; j<v.size(); j++){
                    if((mask>>j)%2==0) continue;
                    if(i!=j && adj[i][j]==0) ctrl=0;
                }
            }
            if(ctrl) ans=max(ans, cnt);
        }
    }
    cout<<ans<<endl;
}

Compilation message

politicaldevelopment.cpp: In function 'int32_t main()':
politicaldevelopment.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<v.size(); i++){
                      ~^~~~~~~~~
politicaldevelopment.cpp:57:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<v.size(); j++){
                          ~^~~~~~~~~
politicaldevelopment.cpp:67:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<v.size(); i++){
                          ~^~~~~~~~~
politicaldevelopment.cpp:70:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int j=0; j<v.size(); j++){
                              ~^~~~~~~~~
politicaldevelopment.cpp:40:27: warning: unused variable 'd' [-Wunused-variable]
         int a=pq.top().y, d=pq.top().x;
                           ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 1556 ms 26784 KB Output is correct
5 Correct 1615 ms 26792 KB Output is correct
6 Correct 41 ms 2588 KB Output is correct
7 Correct 49 ms 2600 KB Output is correct
8 Correct 4 ms 1656 KB Output is correct
9 Correct 3 ms 1576 KB Output is correct
10 Correct 4 ms 1660 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 1556 ms 26784 KB Output is correct
5 Correct 1615 ms 26792 KB Output is correct
6 Correct 41 ms 2588 KB Output is correct
7 Correct 49 ms 2600 KB Output is correct
8 Correct 4 ms 1656 KB Output is correct
9 Correct 3 ms 1576 KB Output is correct
10 Correct 4 ms 1660 KB Output is correct
11 Correct 1489 ms 26780 KB Output is correct
12 Correct 1544 ms 26788 KB Output is correct
13 Correct 3 ms 1572 KB Output is correct
14 Correct 1651 ms 26796 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 47 ms 2612 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 42 ms 2604 KB Output is correct
19 Correct 4 ms 1656 KB Output is correct
20 Correct 5 ms 1960 KB Output is correct
21 Correct 6 ms 2012 KB Output is correct
22 Correct 5 ms 1656 KB Output is correct
23 Correct 13 ms 2352 KB Output is correct
24 Correct 4 ms 1696 KB Output is correct
25 Correct 14 ms 2296 KB Output is correct
26 Correct 14 ms 2268 KB Output is correct
27 Correct 10 ms 2268 KB Output is correct
28 Correct 13 ms 2296 KB Output is correct
29 Correct 10 ms 2268 KB Output is correct
30 Execution timed out 3074 ms 5300 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1656 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1500 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1560 KB Output is correct
8 Correct 3 ms 1524 KB Output is correct
9 Correct 3 ms 1532 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 875 ms 30724 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Incorrect 899 ms 29716 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 1556 ms 26784 KB Output is correct
5 Correct 1615 ms 26792 KB Output is correct
6 Correct 41 ms 2588 KB Output is correct
7 Correct 49 ms 2600 KB Output is correct
8 Correct 4 ms 1656 KB Output is correct
9 Correct 3 ms 1576 KB Output is correct
10 Correct 4 ms 1660 KB Output is correct
11 Correct 1489 ms 26780 KB Output is correct
12 Correct 1544 ms 26788 KB Output is correct
13 Correct 3 ms 1572 KB Output is correct
14 Correct 1651 ms 26796 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 47 ms 2612 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 42 ms 2604 KB Output is correct
19 Correct 4 ms 1656 KB Output is correct
20 Correct 5 ms 1960 KB Output is correct
21 Correct 6 ms 2012 KB Output is correct
22 Correct 5 ms 1656 KB Output is correct
23 Correct 13 ms 2352 KB Output is correct
24 Correct 4 ms 1696 KB Output is correct
25 Correct 14 ms 2296 KB Output is correct
26 Correct 14 ms 2268 KB Output is correct
27 Correct 10 ms 2268 KB Output is correct
28 Correct 13 ms 2296 KB Output is correct
29 Correct 10 ms 2268 KB Output is correct
30 Execution timed out 3074 ms 5300 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 1556 ms 26784 KB Output is correct
5 Correct 1615 ms 26792 KB Output is correct
6 Correct 41 ms 2588 KB Output is correct
7 Correct 49 ms 2600 KB Output is correct
8 Correct 4 ms 1656 KB Output is correct
9 Correct 3 ms 1576 KB Output is correct
10 Correct 4 ms 1660 KB Output is correct
11 Correct 1489 ms 26780 KB Output is correct
12 Correct 1544 ms 26788 KB Output is correct
13 Correct 3 ms 1572 KB Output is correct
14 Correct 1651 ms 26796 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 47 ms 2612 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 42 ms 2604 KB Output is correct
19 Correct 4 ms 1656 KB Output is correct
20 Correct 5 ms 1960 KB Output is correct
21 Correct 6 ms 2012 KB Output is correct
22 Correct 5 ms 1656 KB Output is correct
23 Correct 13 ms 2352 KB Output is correct
24 Correct 4 ms 1696 KB Output is correct
25 Correct 14 ms 2296 KB Output is correct
26 Correct 14 ms 2268 KB Output is correct
27 Correct 10 ms 2268 KB Output is correct
28 Correct 13 ms 2296 KB Output is correct
29 Correct 10 ms 2268 KB Output is correct
30 Execution timed out 3074 ms 5300 KB Time limit exceeded
31 Halted 0 ms 0 KB -