oj.uz

Submission #533349

# Submission time Handle Problem Language Result Execution time Memory
533349 2022-03-05T15:11:58 Z DanerZein Road Closures (APIO21_roads) C++14
24 / 100
 2000 ms 20420 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][3];
ll knap(int u,int p,bool k){
  if(dp[u][k]!=-1) return dp[u][k];
  vector<ii> op;
  vector<iii> aux;
  ll s=0;
  for(auto &v:G[u]){
    if(v.first!=p){
      if(ti>=1){
	if(k || (!k && ti>=2)){
	  op.push_back(ii(knap(v.first,u,1)+v.second,knap(v.first,u,0)));
	  int t=op.size()-1;
	  aux.push_back(iii(op[t],v.first));
	}
      }
      s+=knap(v.first,u,1)+v.second;
    }
  }
  sort(op.begin(),op.end(),orden);
  int c=ti;
  if(!k) c--;
  for(int i=0;i<op.size();i++){
    if(i<c && -op[i].first+op[i].second<=0) 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,1));
  }
  return res;
}

Compilation message

roads.cpp: In function 'll knap(int, int, bool)':
roads.cpp:37: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]
   37 |   for(int i=0;i<op.size();i++){
      |               ~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 379 ms 696 KB Output is correct
3 Correct 416 ms 1216 KB Output is correct
4 Correct 263 ms 1588 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 3 ms 292 KB Output is correct
8 Correct 199 ms 660 KB Output is correct
9 Correct 321 ms 788 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Runtime error 23 ms 12480 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 1 ms 292 KB Output is correct
2 Execution timed out 2065 ms 9052 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 12 ms 368 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 10 ms 356 KB Output is correct
8 Correct 9 ms 332 KB Output is correct
9 Correct 8 ms 332 KB Output is correct
10 Correct 6 ms 292 KB Output is correct
11 Correct 7 ms 332 KB Output is correct
12 Correct 7 ms 400 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 9 ms 296 KB Output is correct
18 Correct 9 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 4 ms 332 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 313 ms 500 KB Output is correct
24 Correct 878 ms 736 KB Output is correct
25 Correct 662 ms 568 KB Output is correct
26 Correct 763 ms 696 KB Output is correct
27 Correct 686 ms 780 KB Output is correct
28 Correct 444 ms 616 KB Output is correct
29 Correct 714 ms 568 KB Output is correct
30 Correct 640 ms 604 KB Output is correct
31 Correct 616 ms 588 KB Output is correct
32 Correct 400 ms 640 KB Output is correct
33 Correct 524 ms 968 KB Output is correct
34 Correct 749 ms 960 KB Output is correct
35 Correct 575 ms 1020 KB Output is correct
36 Correct 377 ms 800 KB Output is correct
37 Correct 495 ms 712 KB Output is correct
38 Correct 260 ms 868 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 10 ms 332 KB Output is correct
43 Correct 9 ms 332 KB Output is correct
44 Correct 8 ms 332 KB Output is correct
45 Correct 9 ms 332 KB Output is correct
46 Correct 8 ms 332 KB Output is correct
47 Correct 6 ms 332 KB Output is correct
48 Correct 7 ms 300 KB Output is correct
49 Correct 8 ms 296 KB Output is correct
50 Correct 2 ms 296 KB Output is correct
51 Correct 4 ms 384 KB Output is correct
52 Correct 5 ms 388 KB Output is correct
53 Correct 533 ms 528 KB Output is correct
54 Correct 874 ms 584 KB Output is correct
55 Correct 611 ms 640 KB Output is correct
56 Correct 209 ms 656 KB Output is correct
57 Correct 325 ms 692 KB Output is correct
58 Correct 3 ms 332 KB Output is correct
59 Correct 10 ms 332 KB Output is correct
60 Correct 8 ms 372 KB Output is correct
61 Correct 3 ms 296 KB Output is correct
62 Correct 4 ms 332 KB Output is correct
63 Correct 1 ms 300 KB Output is correct
64 Correct 828 ms 584 KB Output is correct
65 Correct 887 ms 600 KB Output is correct
66 Correct 439 ms 688 KB Output is correct
67 Correct 510 ms 632 KB Output is correct
68 Correct 425 ms 588 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 55 ms 20420 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 55 ms 20420 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 1 ms 332 KB Output is correct
2 Correct 379 ms 696 KB Output is correct
3 Correct 416 ms 1216 KB Output is correct
4 Correct 263 ms 1588 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 3 ms 292 KB Output is correct
8 Correct 199 ms 660 KB Output is correct
9 Correct 321 ms 788 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Runtime error 23 ms 12480 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -