제출 #838032

#제출 시각아이디문제언어결과실행 시간메모리
838032Kerim전선 연결 (IOI17_wiring)C++17
17 / 100
1090 ms6948 KiB
#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]+1-j; k++){ ll cost = (d[i][1] - d[i-1][sz[i-1]])*1LL*(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); } for (int k = max(1, sz[i-1]+1-j); k <= sz[i-1]; k++){ ll cost = (d[i][1] - d[i-1][sz[i-1]])*1LL*j; 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]]; }

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

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:20:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for (int i = 0; i < v.size(); i++){
      |                  ~~^~~~~~~~~~
wiring.cpp:23:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   while (j < v.size() and v[i].ss == v[j].ss)
      |          ~~^~~~~~~~~~
#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...