제출 #1035183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1035183		Hectorungo_18	Political Development (BOI17_politicaldevelopment)	C++14	4 / 100	131 ms	3924 KiB

politicaldevelopment

#include <bits/stdc++.h>
using namespace std;
 
string abc = "abcdefghijklmnopqrstuvwxyz";
 
// #define int long long
 
void solve(){
    int n, k;
    cin >> n >> k;
    vector<vector<bool>> b(n+3, vector<bool> (n+3, 0));
    vector<int> v;
    for(int i = 0; i < n; i++){
        int r;
        cin >> r;
        for(int j = 0; j < r; j++){
            int a;
            cin >> a;
            b[i][a]=1;
        
        }
        v.push_back(i);
    }
    // for(int i = 0; i < n; i++){
    //     for(int j = 0; j < n; j++){
    //         // cout << i << " " << j << " " <<b[i][j] << endl;
    //     }
    //     // cout << endl;
    // }
    int sz = 0;
    for(int i = 0; i < v.size(); i++){
        int a = v[i];
        set<int> s;
        s.insert(a);
        for(int j = 0; j < n; j++){
            if(b[a][j] == 1) s.insert(j);
            else continue;
            // cout << "in  " << a << " " << j << endl;
        }
        bool im = 0;
        for(auto x : s){
            // cout << x << endl;
            int sz = 0;
            for(int j = 0; j < n; j++){
                if(j == x) continue;
                if(s.count(j) == 1){
                    if(b[x][j]) sz++;
                    else{
                        // cout << x << " " << j << endl;
                        im = 1;
                        break;
                    }
                }
                
            }
            if(im) break;
        }
        // cout << i << " " << a << " " << im << " " << sz << endl;
        if(!im) sz = max(sz, (int) s.size());
    }
    cout << sz << endl;
}


int main(){
    solve();

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

politicaldevelopment.cpp: In function 'void solve()':
politicaldevelopment.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23