제출 #561013

#제출 시각아이디문제언어결과실행 시간메모리
561013OrazBRoad Closures (APIO21_roads)C++14
5 / 100
58 ms8188 KiB
#include "roads.h" #include <bits/stdc++.h> #define N 100005 #define ll long long #define pb push_back using namespace std; std::vector <ll> minimum_closure_costs(int n, std::vector<int> U, std::vector<int> V, std::vector<int> W) { bool sub1 = 0; vector <ll> v, ans; for (int i = 0; i < n-1; i++){ if (U[i]) sub1 = 1; // E[U[i]].pb({V[i], W[i]}); // E[V[i]].pb({U[i], W[i]}); v.pb(W[i]); } if (!sub1){ sort(v.begin(), v.end()); ll p[N]; p[0] = v[0]; for (int i = 1; i < v.size(); i++) p[i] = p[i - 1] + v[i]; for (int k = 0; k < n; k++) ans.pb(p[n - k - 2]); return ans; } } // int main(){ // int n; // cin >> n; // vector <int> U(N), V(N), W(N); // for (int i = 0; i < n-1; i++) cin >> U[i] >> V[i] >> W[i]; // for (int i = 0; i < n; i++) // cout << minimum_closure_costs(n, U, V, W)[i] << " "; // }

컴파일 시 표준 에러 (stderr) 메시지

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int i = 1; i < v.size(); i++) p[i] = p[i - 1] + v[i];
      |                         ~~^~~~~~~~~~
roads.cpp:12:17: warning: control reaches end of non-void function [-Wreturn-type]
   12 |     vector <ll> v, ans;
      |                 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...