oj.uz

Submission #559490

# Submission time Handle Problem Language Result Execution time Memory
559490 2022-05-10T04:11:58 Z fcmalkcin Road Closures (APIO21_roads) C++17
24 / 100
 2000 ms 32664 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll  long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=5e5+50;
const ll mod=1e9+7  ;
const ll base=1e18;


/// i believe myself
/// goal 0/7

#include "roads.h"

vector<pll> adj[maxn];
ll dp[maxn][2];
ll k;
void dfs(ll u,ll par,ll w)
{
    ll cnt=0;
    ll sl=0;

    dp[u][0]+=w;
    if (k==0) dp[u][1]=base;
    vector<ll> vt;
    for (auto p:adj[u])
    {
        ll to=p.ff;
        if (to==par) continue;
        dfs(to,u,p.ss);
        if (dp[to][0]<=dp[to][1])
        {
            dp[u][0]+=dp[to][0];
            dp[u][1]+=dp[to][0];
        }
        else
        {
            sl++;
            dp[u][0]+=dp[to][1];
            dp[u][1]+=dp[to][1];
            vt.pb(dp[to][0]-dp[to][1]);
        }
    }
    sort(vt.begin(),vt.end());
    ll p=sl-k;
    for (int i=0;i<p;i++) dp[u][0]+=vt[i];
   if (k) for (int i=0;i<p+1;i++) dp[u][1]+=vt[i];
}
vector<ll> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W)
{
    ll n=N;
    for (int i=0;i<U.size();i++)
    {
        adj[U[i]+1].pb(make_pair(V[i]+1,W[i]));
        adj[V[i]+1].pb(make_pair(U[i]+1,W[i]));
    }
    vector<ll> res;
    for (int i=0;i<=n-1;i++)
    {
        for (int t=0;t<=n;t++) for (int p=0;p<=1;p++) dp[t][p]=0;
        k=i;
        dfs(1,0,0);
        res.pb(dp[1][0]);
    }
    return res;
}

/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ll n;
    vector<ll> p,p1,p2;
    cin>> n;
    for (int i=1;i<=n-1;i++)
    {
        ll x, y, w;
        cin>> x>> y>> w;
        p.pb(x);
        p1.pb(y);
        p2.pb(w);
    }
    vector<ll> res=minimum_closure_costs(n, p,p1,p2);
    for (auto to:res) cout <<to<<" ";
}*/
/*
5
0 1 1
0 2 4
0 3 3
2 4 2
*/

Compilation message

roads.cpp: In function 'void dfs(long long int, long long int, long long int)':
roads.cpp:27:8: warning: unused variable 'cnt' [-Wunused-variable]
   27 |     ll cnt=0;
      |        ^~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:59:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int i=0;i<U.size();i++)
      |                  ~^~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 160 ms 12264 KB Output is correct
3 Correct 184 ms 12300 KB Output is correct
4 Correct 80 ms 12244 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 8 ms 12040 KB Output is correct
7 Correct 8 ms 11988 KB Output is correct
8 Correct 77 ms 12252 KB Output is correct
9 Correct 120 ms 12284 KB Output is correct
10 Correct 7 ms 12064 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Execution timed out 2095 ms 18884 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12056 KB Output is correct
2 Execution timed out 2054 ms 32664 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12064 KB Output is correct
3 Correct 6 ms 12060 KB Output is correct
4 Correct 8 ms 12064 KB Output is correct
5 Correct 10 ms 12060 KB Output is correct
6 Correct 10 ms 12060 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 12068 KB Output is correct
9 Correct 9 ms 11988 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 7 ms 12020 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 7 ms 12060 KB Output is correct
16 Correct 7 ms 12064 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 9 ms 11988 KB Output is correct
19 Correct 8 ms 11988 KB Output is correct
20 Correct 8 ms 11988 KB Output is correct
21 Correct 7 ms 11988 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 12064 KB Output is correct
3 Correct 6 ms 12060 KB Output is correct
4 Correct 8 ms 12064 KB Output is correct
5 Correct 10 ms 12060 KB Output is correct
6 Correct 10 ms 12060 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 12068 KB Output is correct
9 Correct 9 ms 11988 KB Output is correct
10 Correct 8 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 8 ms 11988 KB Output is correct
13 Correct 7 ms 12020 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 7 ms 12060 KB Output is correct
16 Correct 7 ms 12064 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 9 ms 11988 KB Output is correct
19 Correct 8 ms 11988 KB Output is correct
20 Correct 8 ms 11988 KB Output is correct
21 Correct 7 ms 11988 KB Output is correct
22 Correct 6 ms 12020 KB Output is correct
23 Correct 99 ms 12212 KB Output is correct
24 Correct 261 ms 12288 KB Output is correct
25 Correct 184 ms 12196 KB Output is correct
26 Correct 175 ms 12276 KB Output is correct
27 Correct 148 ms 12348 KB Output is correct
28 Correct 81 ms 12244 KB Output is correct
29 Correct 206 ms 12272 KB Output is correct
30 Correct 128 ms 12284 KB Output is correct
31 Correct 127 ms 12304 KB Output is correct
32 Correct 88 ms 12328 KB Output is correct
33 Correct 119 ms 12476 KB Output is correct
34 Correct 145 ms 12672 KB Output is correct
35 Correct 120 ms 12496 KB Output is correct
36 Correct 163 ms 12292 KB Output is correct
37 Correct 184 ms 12364 KB Output is correct
38 Correct 85 ms 12284 KB Output is correct
39 Correct 7 ms 12056 KB Output is correct
40 Correct 6 ms 12060 KB Output is correct
41 Correct 8 ms 11988 KB Output is correct
42 Correct 8 ms 11988 KB Output is correct
43 Correct 7 ms 12060 KB Output is correct
44 Correct 9 ms 12060 KB Output is correct
45 Correct 9 ms 11988 KB Output is correct
46 Correct 8 ms 11988 KB Output is correct
47 Correct 9 ms 11988 KB Output is correct
48 Correct 8 ms 12044 KB Output is correct
49 Correct 9 ms 12116 KB Output is correct
50 Correct 8 ms 12060 KB Output is correct
51 Correct 8 ms 11988 KB Output is correct
52 Correct 8 ms 12060 KB Output is correct
53 Correct 155 ms 12232 KB Output is correct
54 Correct 257 ms 12364 KB Output is correct
55 Correct 117 ms 12300 KB Output is correct
56 Correct 78 ms 12256 KB Output is correct
57 Correct 129 ms 12264 KB Output is correct
58 Correct 9 ms 12060 KB Output is correct
59 Correct 10 ms 11988 KB Output is correct
60 Correct 8 ms 12064 KB Output is correct
61 Correct 8 ms 12060 KB Output is correct
62 Correct 8 ms 11988 KB Output is correct
63 Correct 7 ms 11988 KB Output is correct
64 Correct 252 ms 12272 KB Output is correct
65 Correct 252 ms 12364 KB Output is correct
66 Correct 93 ms 12268 KB Output is correct
67 Correct 78 ms 12268 KB Output is correct
68 Correct 89 ms 12272 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 21196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 21196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 160 ms 12264 KB Output is correct
3 Correct 184 ms 12300 KB Output is correct
4 Correct 80 ms 12244 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 8 ms 12040 KB Output is correct
7 Correct 8 ms 11988 KB Output is correct
8 Correct 77 ms 12252 KB Output is correct
9 Correct 120 ms 12284 KB Output is correct
10 Correct 7 ms 12064 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Execution timed out 2095 ms 18884 KB Time limit exceeded
13 Halted 0 ms 0 KB -