# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
838030 | 2023-08-26T05:41:07 Z | Kerim | 전선 연결 (IOI17_wiring) | C++17 | 1000 ms | 7108 KB |
#include "wiring.h" #include "bits/stdc++.h" #define ff first #define ss second #define ll long long using namespace std; const ll B = 1e16; void make(vector<ll>&v, int sz){ v.resize(sz); for (int i = 0; i < sz; i++) v[i] = B; } ll min_total_length(vector<int> r, vector<int> b) { vector<pair<int,int> > v; vector<vector<int> > d; vector<int> sz; for (auto x: r) v.push_back({x, 0}); for (auto x: b) v.push_back({x, 1}); sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++){ int j = i; vector<int> g{-1}; while (j < v.size() and v[i].ss == v[j].ss) g.push_back(v[j++].ff); d.push_back(g); sz.push_back(j - i); i = j - 1; } int n = d.size(); vector<ll> dp, odp; make(dp, sz[0]+1); dp[0] = 0; for (int i = 1; i < n; i++){ swap(odp, dp); make(dp, sz[i]+1); dp[0] = odp[sz[i-1]]; for (int j = 1; j <= sz[i]; j++) for (int k = 1; k <= sz[i-1]; k++){ ll cost = (d[i][1] - d[i-1][sz[i-1]])*1LL*max(j, (sz[i-1] - k + 1)); for (int h = k; h <= sz[i-1]; h++) cost += d[i-1][sz[i-1]] - d[i-1][h]; for (int h = 1; h <= j; h++) cost += d[i][h] - d[i][1]; dp[j] = min(dp[j], min(odp[k-1], odp[k]) + cost); } } return dp[sz[n-1]]; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 3 ms | 212 KB | Output is correct |
8 | Correct | 3 ms | 212 KB | Output is correct |
9 | Correct | 2 ms | 212 KB | Output is correct |
10 | Correct | 4 ms | 260 KB | Output is correct |
11 | Correct | 2 ms | 212 KB | Output is correct |
12 | Correct | 2 ms | 212 KB | Output is correct |
13 | Correct | 2 ms | 212 KB | Output is correct |
14 | Correct | 2 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 304 KB | Output is correct |
16 | Correct | 2 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 3 ms | 212 KB | Output is correct |
3 | Execution timed out | 1030 ms | 4412 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 46 ms | 6936 KB | Output is correct |
4 | Correct | 47 ms | 6716 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 | 0 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 1 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 1 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 212 KB | Output is correct |
17 | Correct | 1 ms | 212 KB | Output is correct |
18 | Correct | 44 ms | 7024 KB | Output is correct |
19 | Correct | 47 ms | 7108 KB | Output is correct |
20 | Correct | 47 ms | 6724 KB | Output is correct |
21 | Correct | 48 ms | 6972 KB | Output is correct |
22 | Correct | 45 ms | 6716 KB | Output is correct |
23 | Correct | 45 ms | 6716 KB | Output is correct |
24 | Correct | 46 ms | 6688 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 1081 ms | 4292 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 3 ms | 212 KB | Output is correct |
8 | Correct | 3 ms | 212 KB | Output is correct |
9 | Correct | 2 ms | 212 KB | Output is correct |
10 | Correct | 4 ms | 260 KB | Output is correct |
11 | Correct | 2 ms | 212 KB | Output is correct |
12 | Correct | 2 ms | 212 KB | Output is correct |
13 | Correct | 2 ms | 212 KB | Output is correct |
14 | Correct | 2 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 304 KB | Output is correct |
16 | Correct | 2 ms | 212 KB | Output is correct |
17 | Correct | 1 ms | 212 KB | Output is correct |
18 | Correct | 3 ms | 212 KB | Output is correct |
19 | Execution timed out | 1030 ms | 4412 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |