oj.uz

답안 #135648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135648 2019-07-24T09:21:30 Z miguel Political Development (BOI17_politicaldevelopment) C++14
0 / 100
 12 ms 2168 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;
        v.pb(a);
        for(int i : g[a]){
            if(!viz[i]){
                deg[i]--;
                pq.push({deg[i], i});
                v.pb(i);
            }
        }
        //for(int i : v) cout<<i<<" "; cout<<endl;
        int adj[11][11];
        for(int i=0; i<v.size(); i++){
            for(int j=0; j<v.size(); j++){
                if(i!=j && edg.find({v[i], v[j]})!=edg.end()){
                    adj[i][j]=1;
                }
            }
        }
        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:56:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<v.size(); j++){
                          ~^~~~~~~~~
politicaldevelopment.cpp:65:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<v.size(); i++){
                          ~^~~~~~~~~
politicaldevelopment.cpp:68: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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Incorrect 12 ms 2168 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Incorrect 12 ms 2168 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1656 KB Output is correct
2 Incorrect 4 ms 1528 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Incorrect 12 ms 2168 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Incorrect 12 ms 2168 KB Output isn't correct
4 Halted 0 ms 0 KB -