# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
22588 | 2017-04-30T05:45:25 Z | 카시코이(#958, xdoju, ntopia, pps789) | Logistical Metropolis (KRIII5_LM) | C++11 | 86 ms | 1356 KB |
#include <cstdio> #include <cassert> #include <algorithm> #include <vector> using namespace std; struct edge{ int x, y, d; bool operator< (const edge& rhs) const { return d < rhs.d; } }; vector<edge> e; vector<pair<int, int> > con[1010]; int par[1010]; int getpar(int x){ if(x == par[x]) return x; return (par[x] = getpar(par[x])); } int main(){ int N, M; scanf("%d%d", &N, &M); assert(N <= 1000); for(int i = 0; i < M; i++){ int x, y, d; scanf("%d%d%d", &x, &y, &d); con[x].push_back({y, d}); con[y].push_back({x, d}); e.push_back({x, y, d}); } sort(e.begin(), e.end()); for(int V = 1; V <= N; V++){ for(int i = 1; i <= N; i++) par[i] = i; int s = 0; for(auto &pp : con[V]){ s += pp.second; par[pp.first] = V; } for(edge& ee : e){ int px = getpar(ee.x); int py = getpar(ee.y); if(px != py){ s += ee.d; par[py] = px; } } printf("%d\n", s); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 76 ms | 1352 KB | Output is correct |
2 | Correct | 69 ms | 1352 KB | Output is correct |
3 | Correct | 73 ms | 1356 KB | Output is correct |
4 | Correct | 69 ms | 1352 KB | Output is correct |
5 | Correct | 69 ms | 1352 KB | Output is correct |
6 | Correct | 76 ms | 1352 KB | Output is correct |
7 | Correct | 73 ms | 1352 KB | Output is correct |
8 | Correct | 76 ms | 1352 KB | Output is correct |
9 | Correct | 76 ms | 1352 KB | Output is correct |
10 | Correct | 73 ms | 1352 KB | Output is correct |
11 | Correct | 76 ms | 1352 KB | Output is correct |
12 | Correct | 79 ms | 1352 KB | Output is correct |
13 | Correct | 86 ms | 1352 KB | Output is correct |
14 | Correct | 83 ms | 1352 KB | Output is correct |
15 | Correct | 86 ms | 1352 KB | Output is correct |
16 | Correct | 36 ms | 1352 KB | Output is correct |
17 | Correct | 36 ms | 1352 KB | Output is correct |
18 | Correct | 36 ms | 1352 KB | Output is correct |
19 | Correct | 39 ms | 1352 KB | Output is correct |
20 | Correct | 36 ms | 1352 KB | Output is correct |
21 | Correct | 36 ms | 1352 KB | Output is correct |
22 | Correct | 39 ms | 1352 KB | Output is correct |
23 | Correct | 33 ms | 1352 KB | Output is correct |
24 | Correct | 36 ms | 1352 KB | Output is correct |
25 | Correct | 0 ms | 1204 KB | Output is correct |
26 | Correct | 0 ms | 1204 KB | Output is correct |
27 | Correct | 0 ms | 1204 KB | Output is correct |
28 | Correct | 6 ms | 1204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1208 KB | Execution killed because of forbidden syscall gettid (186) |
2 | Halted | 0 ms | 0 KB | - |