Submission #45331

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
45331	2018-04-12T22:15:26 Z	imaxblue	Triumphal arch (POI13_luk)	C++17	100 / 100	1064 ms	33592 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];
ll dfs(int N, int P){
    ll D=0;
    if (D<0) return 0;
    fox(l, v[N].size()){
        if (v[N][l]==P) continue;
        D+=dfs(v[N][l], N)+1;
    }
    return max(0LL, D-mid);
}
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, -1)==0) hi=mid;
        else lo=mid+1;
    }
    mid=150000;
    //cout << dfs(1, 0, -1) << endl;
    cout << lo;
    return 0;
}

Compilation message

luk.cpp: In function 'long long int dfs(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	8 ms	7524 KB	Output is correct
3	Correct	7 ms	7524 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	7524 KB	Output is correct
2	Correct	8 ms	7524 KB	Output is correct
3	Correct	8 ms	7580 KB	Output is correct
4	Correct	8 ms	7580 KB	Output is correct
5	Correct	10 ms	7580 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	7604 KB	Output is correct
2	Correct	7 ms	7732 KB	Output is correct
3	Correct	7 ms	7732 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	7732 KB	Output is correct
2	Correct	9 ms	7732 KB	Output is correct
3	Correct	8 ms	7800 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	8108 KB	Output is correct
2	Correct	19 ms	8276 KB	Output is correct
3	Correct	14 ms	8364 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	9116 KB	Output is correct
2	Correct	43 ms	10156 KB	Output is correct
3	Correct	23 ms	10156 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	232 ms	12620 KB	Output is correct
2	Correct	230 ms	13768 KB	Output is correct
3	Correct	67 ms	13768 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	570 ms	16484 KB	Output is correct
2	Correct	564 ms	22052 KB	Output is correct
3	Correct	282 ms	22052 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	967 ms	25516 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1034 ms	25516 KB	Output is correct
2	Correct	1064 ms	32632 KB	Output is correct
3	Correct	395 ms	33592 KB	Output is correct