# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
357575 | ijxjdjd | Simfonija (COCI19_simfonija) | C++14 | 76 ms | 3560 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int N;
int K;
cin >> N >> K;
deque<int> farleft;
ll sumfarleft = 0;
deque<int> left;
ll sumleft = 0;
deque<int> right;
ll sumright = 0;
deque<int> farright;
ll sumfarright = 0;
int A[N];
int B[N];
int X = (int)(1e6)+1;
// int X = 0;
vector<int> diff;
FR(i, N) {
cin >> A[i];
A[i] -= X;
}
FR(i, N) {
cin >> B[i];
diff.push_back(A[i] - B[i]);
}
sort(diff.begin(), diff.end());
FR(i, K) {
farleft.push_back(diff[i]);
sumfarleft += -diff[i];
}
for (int i = K; i < N; i++) {
left.push_back(diff[i]);
sumleft += -diff[i];
}
ll ans = ll(1e18);
for (int i = 1; i <= 2*X; i++) {
ans = min(ans, sumleft + sumright);
sumleft -= left.size();
sumfarleft -= farleft.size();
sumright += right.size();
sumfarright += farright.size();
while (left.size() > 0 && (left.back()) == -i) {
left.pop_back();
right.push_front(-i);
}
while (farleft.size() > 0 && (farleft.back()) == -i) {
farleft.pop_back();
right.push_front(-i);
}
while (right.size() > 0 && farleft.size() > 0 && (-(farleft.back()+i) < right.back()+i)) {
left.push_front(farleft.back());
sumleft += -(farleft.back() + i);
sumfarleft -= -(farleft.back() + i);
farleft.pop_back();
farright.push_front(right.back());
sumright -= right.back() + i;
sumfarright += right.back() + i;
right.pop_back();
}
while (farleft.size() + farright.size() < K) {
farright.push_front(right.back());
sumfarright += right.back() + i;
sumright -= right.back() + i;
right.pop_back();
}
}
cout << ans << '\n';
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |