oj.uz

Submission #817484

# Submission time Handle Problem Language Result Execution time Memory
817484 2023-08-09T12:53:53 Z YassirSalama Road Closures (APIO21_roads) C++17
5 / 100
 41 ms 6348 KB 
#include "roads.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pb push_back
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#define endl "\n"
#define mod 1000000007
const ll INF=1e18;


vector<long long> minimum_closure_costs(int N, vector<int> U,
                                             vector<int> V,
                                             vector<int> W) {
    vector<ll> ans(N,0);
    vector<ll> costs;
    for(int i=0;i<W.size();i++) costs.pb(W[i]);
    sort(all(costs));
    for(int i=1;i<costs.size();i++) costs[i]+=costs[i-1];
    for(int k=0;k<N-1;k++){
        int cost=0;
        int kk=N-k-2;
        // dbg(kk);
        ans[k]=(ll)costs[kk];
    }
    return ans;
}


#ifdef IOI
int main() {
  int N;
  assert(1 == scanf("%d", &N));

  vector<int> U(N - 1), V(N - 1), W(N - 1);
  for (int i = 0; i < N - 1; ++i) {
    assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
  }

  vector<long long> closure_costs = minimum_closure_costs(N, U, V, W);
  for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) {
    if (i > 0) {
      printf(" ");
    }
    printf("%lld",closure_costs[i]);
  }
  printf("\n");
  return 0;
}


#endif

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<W.size();i++) costs.pb(W[i]);
      |                 ~^~~~~~~~~
roads.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=1;i<costs.size();i++) costs[i]+=costs[i-1];
      |                 ~^~~~~~~~~~~~~
roads.cpp:28:13: warning: unused variable 'cost' [-Wunused-variable]
   28 |         int cost=0;
      |             ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 19 ms 3408 KB Output is correct
13 Correct 32 ms 5444 KB Output is correct
14 Correct 36 ms 5708 KB Output is correct
15 Correct 40 ms 6232 KB Output is correct
16 Correct 41 ms 6324 KB Output is correct
17 Correct 36 ms 6348 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 28 ms 5064 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 34 ms 5752 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 19 ms 3408 KB Output is correct
13 Correct 32 ms 5444 KB Output is correct
14 Correct 36 ms 5708 KB Output is correct
15 Correct 40 ms 6232 KB Output is correct
16 Correct 41 ms 6324 KB Output is correct
17 Correct 36 ms 6348 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 28 ms 5064 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 34 ms 5752 KB Output isn't correct
22 Halted 0 ms 0 KB -