제출 #640449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640449		andecaandeci	Stranded Far From Home (BOI22_island)	C++17	0 / 100	2 ms	640 KiB

island

#include <bits/stdc++.h>
using namespace std;

int n, m;
int v[2005];
pair<int ,int> arr[2005];
vector<int> adj[2005];

bool vis[2005];

int bfs(int start) {
    // cout << "-----------" << endl;
    priority_queue<pair<int ,int> , vector<pair<int, int> >, greater<pair<int ,int> > > pq;
    queue<int> q;
    memset(vis, 0, sizeof(vis));
    q.push(start);
    vis[start] = true;
    int cnt = 0;
    int sz = v[start];
    while(!q.empty()) {
        int cur = q.front();
        // cout << "::" << cur << endl;
        q.pop();
        for(int i = 0; i < adj[cur].size(); i++) {
            int nx = adj[cur][i];
            // cout << nx << endl;
            if (!vis[nx]) {
                vis[nx] = true;
                pq.push(make_pair(v[nx], nx));
            }
        }

        cnt++;
        // cout << "pq" << endl;
        while (!pq.empty() && pq.top().first <= sz) {
            sz += pq.top().first;
            q.push(pq.top().second);
            // cout << pq.top().second << endl;
            pq.pop();
        }
    }
    if (cnt == n) {
        return 1;
    }
    else {
        return 0;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
        arr[i].first = v[i];
        arr[i].second = i;

    }

    for(int i = 1; i <= m; i++ ) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    for(int i = 1; i <= n; i++) {
        cout << bfs(i);
    }
    cout << endl;
}

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

island.cpp: In function 'int bfs(int)':
island.cpp:24:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int i = 0; i < adj[cur].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 35