oj.uz

Submission #533138

# Submission time Handle Problem Language Result Execution time Memory
533138 2022-03-05T00:58:12 Z DanerZein Road Closures (APIO21_roads) C++14
0 / 100
 2000 ms 85444 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ii> vi;
typedef pair<ii,ll> iii;
const ll MAX=1e16;
const int MAX_N=2e3+10;
bool vis[MAX_N];
vector<vi> G;
int n,ti;
bool orden(ii a,ii b){
  return -a.first+a.second<-b.first+b.second;
}
ll dp[MAX_N][MAX_N];
ll knap(int u,int p,int k){
  if(dp[u][k]!=-1) return dp[u][k];
  vector<ii> op;
  ll s=0;
  for(auto &v:G[u]){
    if(v.first!=p){
      if(k>=1){
	op.push_back(ii(knap(v.first,u,k)+v.second,knap(v.first,u,k-1)));
      }
      s+=knap(v.first,u,k)+v.second;
    }
  }
  sort(op.begin(),op.end(),orden);
  int c=0;
  for(int i=0;i<op.size();i++){
    if(i<k) s+=(-op[i].first+op[i].second);
  }
  return dp[u][k]=s;
}
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  n=N;
  vector<ll> res;
  //vector<iii> ed;
  G.resize(n+1);
  for(int i=0;i<n-1;i++){
    int a=U[i],b=V[i],w=W[i];
    G[a].push_back(ii(b,w));
    G[b].push_back(ii(a,w));
    //ed.push_back(iii(ii(a,b),w));
  }
  for(int i=0;i<n;i++){
    ti=i;
    memset(dp,-1,sizeof dp);
    res.push_back(knap(0,0,i));
  }
  return res;
}

Compilation message

roads.cpp: In function 'll knap(int, int, int)':
roads.cpp:31:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(int i=0;i<op.size();i++){
      |               ~^~~~~~~~~~
roads.cpp:30:7: warning: unused variable 'c' [-Wunused-variable]
   30 |   int c=0;
      |       ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Execution timed out 2050 ms 32184 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31816 KB Output is correct
2 Execution timed out 2064 ms 41712 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31860 KB Output is correct
2 Correct 29 ms 31820 KB Output is correct
3 Correct 23 ms 31908 KB Output is correct
4 Incorrect 537 ms 31924 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31860 KB Output is correct
2 Correct 29 ms 31820 KB Output is correct
3 Correct 23 ms 31908 KB Output is correct
4 Incorrect 537 ms 31924 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 88 ms 85444 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 88 ms 85444 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 16 ms 31820 KB Output is correct
2 Execution timed out 2050 ms 32184 KB Time limit exceeded
3 Halted 0 ms 0 KB -