Submission #103381

#TimeUsernameProblemLanguageResultExecution timeMemory
103381RockyB전선 연결 (IOI17_wiring)C++17
0 / 100
1068 ms22352 KiB
/// In The Name Of God #include <bits/stdc++.h> #define f first #define s second #define pb push_back #define pp pop_back #define mp make_pair #define sz(x) (int)x.size() #define sqr(x) ((x) * 1ll * (x)) #define all(x) x.begin(), x.end() #define rep(i, l, r) for (int i = (l); i <= (r); i++) #define per(i, l, r) for (int i = (l); i >= (r); i--) #define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); #define nl '\n' #define ioi exit(0); typedef long long ll; typedef long double ld; typedef unsigned long long ull; const int N = (int)4e5 + 7; const int inf = (int)1e9 + 7; const int mod = (int)1e9 + 7; const ll linf = (ll)1e18 + 7; const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}; const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; using namespace std; vector < pair <int, int > > t; ll dp[N]; ll get(int l, int r) { int n, m; int id = -1; rep(i, l, r - 1) { if (t[i].s != t[i + 1].s) { n = i - l + 1; m = r - i; id = i; break; } } //if (id == -1) return -linf; ll res = 0; rep(i, l, id) res += t[id].f - t[i].f; rep(i, id + 1, r) res += t[i].f - t[id + 1].f; res += max(n, m) * (t[id + 1].f - t[id].f); return res; } ll calc(int v = 0) { if (v == sz(t)) return 0; if (~dp[v]) return dp[v]; ll res = linf; { /// go to the left bool ok = 0; ll sum = t[v].f; per(i, v - 1, 0) { if (t[i].s != t[v].s) { res = min(res, calc(v + 1) + sum - t[i].f * (v - i)); break; } sum += t[i].f; } } { /// go to the right bool ok = 0; rep(i, v + 1, sz(t) - 1) { if (t[i].s != t[v].s) { ok = 1; res = min(res, calc(i + 1) + get(v, i)); } else if (ok) break; } } return dp[v] = res; } ll min_total_length(vector <int> _r, vector <int> _b) { for (auto it : _r) t.pb({it, 0}); for (auto it : _b) t.pb({it, 1}); sort(all(t)); memset(dp, -1, sizeof(dp)); return calc(); } #ifdef IOI2018 namespace read { void read() { int n, m; assert(2 == scanf("%d %d", &n, &m)); vector<int> r(n), b(m); for(int i = 0; i < n; i++) assert(1 == scanf("%d", &r[i])); for(int i = 0; i < m; i++) assert(1 == scanf("%d", &b[i])); long long res = min_total_length(r, b); printf("%lld\n", res); ioi } } int main() { #ifdef IOI2018 freopen ("in.txt", "r", stdin); #endif read :: read(); ioi } #endif

Compilation message (stderr)

wiring.cpp: In function 'll calc(int)':
wiring.cpp:64:8: warning: unused variable 'ok' [-Wunused-variable]
   bool ok = 0;
        ^~
wiring.cpp: In function 'll get(int, int)':
wiring.cpp:42:9: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int n, m;
         ^
wiring.cpp:42:6: warning: 'n' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int n, m;
      ^
#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...