# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1161152 | just | 도로 폐쇄 (APIO21_roads) | C++20 | 33 ms | 8080 KiB |
#include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define int long long
#define vec vector
#define pii pair<int, int>
#define X first
#define Y second
vec<int> calc(int n, vec<pii> edges, vec<int> costs) {
bool is_star = true;
for(auto [u, _]: edges) is_star &= u == 0;
if (is_star) {
sort(all(costs));
partial_sum(all(costs), costs.begin());
reverse(all(costs));
costs.push_back(0);
return costs;
}
assert(!is_star);
}
vec<int> minimum_closure_costs(
signed N,
vec<signed> U,
vec<signed> V,
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |