oj.uz

Submission #45311

# Submission time Handle Problem Language Result Execution time Memory
45311 2018-04-12T19:46:22 Z imaxblue Triumphal arch (POI13_luk) C++17
30 / 100
 906 ms 19540 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define vi vector<int>
#define vpii vector<pii>
#define vp3i vector<p3i>
#define vpll vector<pll>
#define vp3l vector<p3l>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846
#define siz(x) (int)(x.size())
#define int ll

int n, x, y, lo, mid, hi=300000;
vector<int> v[300005];
bool dfs(int N, ll D, int P){
    D=D+mid-siz(v[N])+(P!=-1);
    if (D<0) return 0;
    fox(l, v[N].size()){
        if (v[N][l]==P) continue;
        if (!dfs(v[N][l], D, N)) return 0;
    }
    return 1;
}
int32_t main(){
    scanf("%lli", &n);
    fox(l, n-1){
        scanf("%lli%lli", &x, &y);
        v[x].pb(y);
        v[y].pb(x);
    }
    while(lo<hi){
        mid=(lo+hi)/2;
        if (dfs(1, 0, -1)) hi=mid;
        else lo=mid+1;
    }
    mid=150000;
    //cout << dfs(1, 0, -1) << endl;
    cout << lo;
    return 0;
}

Compilation message

luk.cpp: In function 'bool dfs(long long int, long long int, long long int)':
luk.cpp:23:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
luk.cpp:42:9:
     fox(l, v[N].size()){
         ~~~~~~~~~~~~~~            
luk.cpp:42:5: note: in expansion of macro 'fox'
     fox(l, v[N].size()){
     ^~~
luk.cpp: In function 'int32_t main()':
luk.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lli", &n);
     ~~~~~^~~~~~~~~~~~
luk.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lli%lli", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7288 KB Output is correct
2 Correct 7 ms 7396 KB Output is correct
3 Correct 9 ms 7472 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7472 KB Output is correct
2 Correct 7 ms 7548 KB Output is correct
3 Correct 7 ms 7548 KB Output is correct
4 Correct 8 ms 7564 KB Output is correct
5 Correct 9 ms 7564 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7624 KB Output is correct
2 Correct 8 ms 7624 KB Output is correct
3 Correct 7 ms 7624 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 7916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 8812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 11588 KB Output is correct
2 Correct 155 ms 13256 KB Output is correct
3 Incorrect 65 ms 13256 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 601 ms 15520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 906 ms 19448 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 906 ms 19540 KB Output isn't correct
2 Halted 0 ms 0 KB -