oj.uz

Submission #488790

# Submission time Handle Problem Language Result Execution time Memory
488790 2021-11-20T13:13:08 Z Theo830 Road Closures (APIO21_roads) C++17
0 / 100
 2000 ms 11828 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 += 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 183 ms 532 KB Output is correct
3 Correct 218 ms 540 KB Output is correct
4 Correct 136 ms 532 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 97 ms 508 KB Output is correct
9 Correct 149 ms 536 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Runtime error 23 ms 11828 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 2086 ms 8748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Incorrect 3 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Incorrect 3 ms 300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 125 ms 11076 KB Output isn't correct
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 183 ms 532 KB Output is correct
3 Correct 218 ms 540 KB Output is correct
4 Correct 136 ms 532 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 97 ms 508 KB Output is correct
9 Correct 149 ms 536 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Runtime error 23 ms 11828 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -