oj.uz

답안 #394445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394445 2021-04-26T16:31:47 Z teehandsome 경주 (Race) (IOI11_race) C++11
21 / 100
 3000 ms 11068 KB 
#include "race.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxn=2e5+10;
int n,k;
vector<pii> adj[mxn];

int solve(int u,int p,int sum) {
    if(!sum) return 0;
    if(sum<0) return -1;
    int res=INF;
    for(auto vw:adj[u]) {
        int v=vw.first, w=vw.second;
        if(v==p) continue;
        int temp=solve(v,u,sum-w);
        if(temp!=-1) res=min(res,1+temp);
    }
    if(res==INF) return -1;
    return res;
}

int best_path(int N, int K, int H[][2], int L[])
{
    n=N,k=K;
    for(int i=0;i<n-1;i++) {
        int u=H[i][0],v=H[i][1],w=L[i];
        adj[u].push_back({v,w});
        adj[v].push_back({u,w});
    }
    int ans=INF;
    for(int i=0;i<n;i++) {
        int temp=solve(i,i,k);
        if(temp!=-1) ans=min(ans,temp);
    }
    if(ans==INF) return -1;
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5004 KB Output is correct
7 Correct 4 ms 5000 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 4988 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5004 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5004 KB Output is correct
7 Correct 4 ms 5000 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 4988 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5004 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5000 KB Output is correct
21 Correct 22 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 5 ms 5068 KB Output is correct
24 Correct 4 ms 5068 KB Output is correct
25 Correct 22 ms 5068 KB Output is correct
26 Correct 4 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 8 ms 5068 KB Output is correct
29 Correct 13 ms 5068 KB Output is correct
30 Correct 15 ms 5012 KB Output is correct
31 Correct 21 ms 5016 KB Output is correct
32 Correct 22 ms 5064 KB Output is correct
33 Correct 19 ms 5068 KB Output is correct
34 Correct 5 ms 5068 KB Output is correct
35 Correct 5 ms 4940 KB Output is correct
36 Correct 5 ms 5008 KB Output is correct
37 Correct 11 ms 5068 KB Output is correct
38 Correct 14 ms 5064 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5004 KB Output is correct
7 Correct 4 ms 5000 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 4988 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5004 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Execution timed out 3078 ms 11068 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5004 KB Output is correct
7 Correct 4 ms 5000 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 4988 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5004 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5000 KB Output is correct
21 Correct 22 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 5 ms 5068 KB Output is correct
24 Correct 4 ms 5068 KB Output is correct
25 Correct 22 ms 5068 KB Output is correct
26 Correct 4 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 8 ms 5068 KB Output is correct
29 Correct 13 ms 5068 KB Output is correct
30 Correct 15 ms 5012 KB Output is correct
31 Correct 21 ms 5016 KB Output is correct
32 Correct 22 ms 5064 KB Output is correct
33 Correct 19 ms 5068 KB Output is correct
34 Correct 5 ms 5068 KB Output is correct
35 Correct 5 ms 4940 KB Output is correct
36 Correct 5 ms 5008 KB Output is correct
37 Correct 11 ms 5068 KB Output is correct
38 Correct 14 ms 5064 KB Output is correct
39 Execution timed out 3078 ms 11068 KB Time limit exceeded
40 Halted 0 ms 0 KB -