oj.uz

Submission #488792

# Submission time Handle Problem Language Result Execution time Memory
488792 2021-11-20T13:14:29 Z Theo830 Road Closures (APIO21_roads) C++17
24 / 100
 2000 ms 20036 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///APIO 2021 vc
#include "roads.h"
vector<vector<ii> >adj;
ll dp[2005][2];
ll solve(ll idx,ll k,ll p,bool ep){
    if(dp[idx][ep] != -1){
        return dp[idx][ep];
    }
    ll ans = INF;
    ll siz = k - ep;
    vll ex;
    ll sum = 0;
    for(auto x:adj[idx]){
        if(x.F != p){
            sum += x.S + solve(x.F,k,idx,0);
            ex.pb(solve(x.F,k,idx,1) - (x.S + solve(x.F,k,idx,0)));
        }
    }
    ans = sum;
    sort(all(ex));
    siz = min(siz,(ll)ex.size());
    f(i,0,siz){
        ans += min(0LL,ex[i]);
    }
    return dp[idx][ep] = ans;
}
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
    vll ans;
    adj.assign(N+5,vector<ii>());
    f(i,0,N-1){
        adj[U[i]].pb(ii(V[i],W[i]));
        adj[V[i]].pb(ii(U[i],W[i]));
    }
    f(k,0,N){
        memset(dp,-1,sizeof dp);
        ans.pb(solve(0,k,N + 5,0));
    }
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 193 ms 536 KB Output is correct
3 Correct 219 ms 840 KB Output is correct
4 Correct 112 ms 548 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 100 ms 460 KB Output is correct
9 Correct 148 ms 540 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Runtime error 22 ms 11876 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Execution timed out 2080 ms 8676 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 5 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 4 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 0 ms 208 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 5 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 4 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 172 ms 476 KB Output is correct
24 Correct 460 ms 600 KB Output is correct
25 Correct 325 ms 512 KB Output is correct
26 Correct 339 ms 532 KB Output is correct
27 Correct 334 ms 580 KB Output is correct
28 Correct 203 ms 576 KB Output is correct
29 Correct 389 ms 676 KB Output is correct
30 Correct 293 ms 568 KB Output is correct
31 Correct 286 ms 568 KB Output is correct
32 Correct 197 ms 572 KB Output is correct
33 Correct 241 ms 788 KB Output is correct
34 Correct 319 ms 872 KB Output is correct
35 Correct 258 ms 796 KB Output is correct
36 Correct 183 ms 576 KB Output is correct
37 Correct 211 ms 584 KB Output is correct
38 Correct 113 ms 592 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 3 ms 336 KB Output is correct
42 Correct 5 ms 336 KB Output is correct
43 Correct 3 ms 336 KB Output is correct
44 Correct 4 ms 336 KB Output is correct
45 Correct 4 ms 352 KB Output is correct
46 Correct 4 ms 336 KB Output is correct
47 Correct 3 ms 336 KB Output is correct
48 Correct 4 ms 336 KB Output is correct
49 Correct 4 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 2 ms 352 KB Output is correct
52 Correct 2 ms 336 KB Output is correct
53 Correct 296 ms 644 KB Output is correct
54 Correct 453 ms 560 KB Output is correct
55 Correct 273 ms 712 KB Output is correct
56 Correct 99 ms 544 KB Output is correct
57 Correct 148 ms 464 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 5 ms 336 KB Output is correct
60 Correct 4 ms 336 KB Output is correct
61 Correct 2 ms 336 KB Output is correct
62 Correct 2 ms 336 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 430 ms 680 KB Output is correct
65 Correct 446 ms 552 KB Output is correct
66 Correct 230 ms 552 KB Output is correct
67 Correct 199 ms 536 KB Output is correct
68 Correct 222 ms 552 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 20036 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 20036 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 193 ms 536 KB Output is correct
3 Correct 219 ms 840 KB Output is correct
4 Correct 112 ms 548 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 100 ms 460 KB Output is correct
9 Correct 148 ms 540 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Runtime error 22 ms 11876 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -