Submission #51337

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
51337	2018-06-17 13:52:32	Diuven	철도 요금 (JOI16_ho_t3)	C++11	100 / 100	235 ms	12912 KiB

2016_ho_t3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MX=100010, inf=2e9;
int n, m, q;
int out_e[2*MX];
int out_v[MX];
int dep[MX];
vector<pii> G[MX];
void solve(){
    queue<int> Q;
    fill(dep+1, dep+n+1, -1);
    dep[1]=0, out_v[1]=q+1; Q.push(1);
    while(!Q.empty()){
        int v=Q.front(); Q.pop();
        for(pii &e:G[v]){
            int x, idx; tie(x,idx)=e;
            if(dep[x]>=0 && dep[x]<=dep[v]) continue;
            if(dep[x]<0){
                dep[x]=dep[v]+1;
                Q.push(x);
            }
            out_v[x]=max(out_v[x], min(out_v[v], out_e[idx]));
        }
    }
    int cnt[2*MX]={};
    for(int i=2; i<=n; i++) cnt[out_v[i]]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 14 / 14
• Subtask 3: 35 / 35
• Subtask 4: 39 / 39