oj.uz

답안 #666805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666805 2022-11-29T18:22:03 Z divad Network (BOI15_net) C++14
0 / 100
 8 ms 12056 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#define MAX 500002
using namespace std;
int n,x,y,vf[MAX];
vector<int> v[MAX],frunze;

void dfs(int nod){
    vf[nod] = 1;
    bool ok = false;
    for(auto vecin: v[nod]){
        if(vf[vecin] == 0){
            ok |= true;
            dfs(vecin);
        }
    }
    if(!ok){
        frunze.push_back(nod);
    }
}

int main()
{
    cin >> n;
    for(int i = 1; i < n; i++){
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int rad = 1;
    for(int i = 1; i <= n; i++){
        if(v[i].size() > 1){
            rad = i;
            break;
        }
    }
    dfs(rad);
    if(frunze.size()%2 == 0){
        cout << frunze.size()/2 << "\n";
        for(int i = 0; i < frunze.size()/2; i++){
            cout << frunze[i] << " " << frunze[i + frunze.size()/2] << "\n";
        }
    }else{
        cout << (frunze.size()/2)+1 << "\n";
        for(int i = 0; i < frunze.size()/2; i++){
            cout << frunze[i] << " " << frunze[i + frunze.size()/2] << "\n";
        }
        cout << rad << " " << frunze[frunze.size()-1] << "\n";
    }
    return 0;
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int i = 0; i < frunze.size()/2; i++){
      |                        ~~^~~~~~~~~~~~~~~~~
net.cpp:46:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int i = 0; i < frunze.size()/2; i++){
      |                        ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12052 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 8 ms 12056 KB Output is correct
7 Incorrect 6 ms 11988 KB Breaking single line is causing network to disconnect.
8 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12052 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 8 ms 12056 KB Output is correct
7 Incorrect 6 ms 11988 KB Breaking single line is causing network to disconnect.
8 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12052 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 8 ms 12056 KB Output is correct
7 Incorrect 6 ms 11988 KB Breaking single line is causing network to disconnect.
8 Halted 0 ms 0 KB -