제출 #852927

#제출 시각아이디문제언어결과실행 시간메모리
852927hngwlog전선 연결 (IOI17_wiring)C++14
0 / 100
1 ms596 KiB
#include <bits/stdc++.h> #include "wiring.h" using namespace std; #define fi first #define se second #define _size(x) (int)x.size() #define BIT(i, x) ((x >> i) & 1) #define MASK(n) ((1 << n) - 1) #define REP(i, n) for (int i = 0, _n = (n); i < _n; i++) #define FOR(i, a, b) for (int i = a, _b = (b); i <= _b; i++) #define FORD(i, a, b) for (int i = a, _b = (b); i >= _b; i--) #define FORB1(i, mask) for (int i = mask; i > 0; i ^= i & - i) #define FORB0(i, n, mask) for (int i = ((1 << n) - 1) ^ mask; i > 0; i ^= i & - i) #define FORALL(i, a) for (auto i: a) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); long long min_total_length(vector<int> r, vector<int> b) { vector<long long> sum(_size(b)); REP(i, _size(b)) sum[i] = b[i] + (i > 0 ? sum[i - 1] : 0); long long ans = 0; int j = 0; REP(i, _size(r) - 1) { int pos = upper_bound(b.begin(), b.end(), (r[i] + r[i + 1]) / 2) - b.begin(); pos--; if (pos <= j) { ans += abs(r[i] - b[j]); j++; continue; } pos = min(pos, _size(b) - 1 - (_size(r) - i - 1)); int _pos = lower_bound(b.begin(), b.end(), r[i]) - b.begin(); _pos = min(_pos, pos); if (j <= _pos - 1) ans += 1LL * (_pos - j) * r[i] - (sum[_pos - 1] - (j ? sum[j - 1] : 0)); if (_pos <= pos) ans += sum[pos] - (_pos ? sum[_pos - 1] : 0) - 1LL * (pos - _pos + 1) * r[i]; j = pos + 1; } FOR(i, j, _size(b) - 1) ans += abs(r.back() - b[i]); return ans; }
#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...