oj.uz

답안 #91865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
91865 2018-12-30T16:42:22 Z karma Network (BOI15_net) C++11
0 / 100
 6 ms 5116 KB 
#include<bits/stdc++.h>
#define For(i, a, b)  for(int i = a, _b = b; i <= _b; ++i)
#define Ford(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define FileName      "test"
#define ll            long long
#define ld            long double
#define ull           unsigned long
#define Print(x)      cerr << #x << "is " << x << '\n';
#define pb            push_back
#define X             first
#define Y             second
//#define Karma

using namespace std;

template<typename T> inline void Cin(T &x)
{
    char c;
    T sign = 1;
    x = 0;
    for (c = getchar(); c < '0' || c > '9'; c = getchar())
        if (c == '-') sign = -1;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
    x *= sign;
}
template <typename T> inline void Out(T x) {if(x > 9) Out(x / 10); putchar(x % 10 + '0');}
template <typename T> inline void Cout(T x, char c) {if(x < 0) putchar('-'); x = abs(x); Out(x); putchar(c);}
template <typename T, typename... Args> inline void Cin(T& a, Args&... args) {Cin(a);Cin(args...);}
template <typename T, typename... Args> inline void Cout(T a, char c, Args... args) {Cout(a, c);Cout(args...);}

typedef pair<int, int> pii;
typedef pair<ll, int> plli;
const int N = 2e5 + 7;

int n, u, v;
vector<int> res, a[N];

void Enter()
{
     Cin(n);
     For(i, 2, n)
     {
         Cin(u, v);
         a[u].pb(v), a[v].pb(u);
     }
     For(i, 1, n) if(a[i].size() == 1) res.pb(i);
}

void Solve()
{
     int sz = res.size();
     cout << (sz + 1) / 2 << '\n';
     for(int i = 1; i < sz; i += 2) cout << res[i] << ' ' << res[i - 1] << '\n';
     if(sz & 1) cout << res[sz - 1] << ' ' << res[0] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef Karma
    freopen(FileName".inp", "r", stdin);
    freopen(FileName".out", "w", stdout);
#endif // Karma

    Enter();
    Solve();

    return 0;
}

Subtask #1
0 / 18.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 37.0

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