제출 #137092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
137092		silxikys	Network (BOI15_net)	C++14	100 / 100	1022 ms	62668 KiB

net

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

const int maxn = 5e5+5;
int n;
int deg[maxn];
int subtree[maxn];

int pre[maxn];
int low[maxn];
bool v[maxn];

int point = 0;

struct Edge
{
    int to, id;
};
vector<Edge> adj[maxn];

bool hasBridge = false;

void go(int now, int fromID) {
    if (hasBridge) return;
    pre[now] = point++;
    v[now] = true;
    low[now] = pre[now];
    bool isArt = false;
    int childCnt = 0;
    for (int i = 0; i < adj[now].size(); i++) {
        if (adj[now][i].id == fromID) continue;
        int to = adj[now][i].to;
        if (v[to]) {
            //to must be an ancestor of now
            low[now] = min(low[now],pre[to]);
        }
        else {
            //bold edge going downwards
            go(to,adj[now][i].id);
            childCnt++;
            low[now] = min(low[now],low[to]);
            if (low[to] >= pre[now]) {
                isArt = true;
            }
            if (pre[now] < low[to]) {
                hasBridge = true;
            }
        }
    }
    if (fromID == -1) {
        isArt = childCnt != 1;
    }
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    srand(time(NULL));
    cin >> n;
    vector<pair<int,int>> edges;
    for (int i = 0; i < n - 1; i++) {
        int a, b; cin >> a >> b;
        ++deg[a];
        ++deg[b];
        edges.push_back({a,b});
    }
    vector<int> leafs;
    for (int i = 1; i <= n; i++) {
        if (deg[i] == 1) leafs.push_back(i);
    }
    while (true) {
        point = 0;
        memset(v,false,sizeof v);
        memset(pre,0,sizeof pre);
        memset(low,false,sizeof low);
        hasBridge = false;
        random_shuffle(leafs.begin(),leafs.end());
        int id = 0;
        for (int i = 1; i <= n; i++) {
            adj[i].clear();
        }
        for (int i = 0; i < n - 1; i++, id++) {
            adj[edges[i].second].push_back({edges[i].first,id});
            adj[edges[i].first].push_back({edges[i].second,id});
        }
        for (int i = 0; i < leafs.size(); i += 2, id++) {
            int nxt = leafs[(i+1)%leafs.size()];
            adj[leafs[i]].push_back({nxt,id});
            adj[nxt].push_back({leafs[i],id});
        }
        go(1,-1);
        if (!hasBridge) {
            //output
            cout << ((leafs.size()+1)/2) << '\n';
            for (int i = 0; i < leafs.size(); i += 2, id++) {
                int nxt = leafs[(i+1)%leafs.size()];
                cout << leafs[i] << ' ' << nxt << '\n';
            }
            return 0;
        }
    }
}

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

net.cpp: In function 'void go(int, int)':
net.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < adj[now].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~
net.cpp:29:10: warning: variable 'isArt' set but not used [-Wunused-but-set-variable]
     bool isArt = false;
          ^~~~~
net.cpp: In function 'int main()':
net.cpp:87:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < leafs.size(); i += 2, id++) {
                         ~~^~~~~~~~~~~~~~
net.cpp:96:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i = 0; i < leafs.size(); i += 2, id++) {
                             ~~^~~~~~~~~~~~~~

• Subtask 1: 18 / 18
• Subtask 2: 45 / 45
• Subtask 3: 37 / 37