#include <bits/stdc++.h>
using namespace std;
#define int long long
int N, M, D;
vector<int> A;
int ans = 0;
signed main() {
ios::sync_with_stdio(false), cout.tie(0), cin.tie(0);
cin >> N >> M >> D;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int in;
for (int i = 0; i < M; i++) {
cin >> in;
A.push_back(in);
sort(A.begin(), A.end());
int truc = 0;
int cur = 0;
int mini = 0;
for (int i = (int)A.size()-2; i >= 0; i--) {
int deltamin = D+A[i]-A[i+1];
if (deltamin >= 0) {
cur = cur - deltamin;
} else {
cur = min(truc - deltamin, truc);
}
mini = min(cur, mini);
}
int ans = abs(mini);
cout << (ans>>1); if (ans & 1) cout << ".5";
cout << (i == M-1 ? '\n' : ' ');
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
112 ms |
3424 KB |
Output is correct |
10 |
Correct |
155 ms |
5316 KB |
Output is correct |
11 |
Correct |
46 ms |
5332 KB |
Output is correct |
12 |
Correct |
177 ms |
5320 KB |
Output is correct |
13 |
Correct |
48 ms |
4828 KB |
Output is correct |
14 |
Correct |
107 ms |
5320 KB |
Output is correct |
15 |
Correct |
100 ms |
4688 KB |
Output is correct |
16 |
Correct |
53 ms |
5336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1565 ms |
1028 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1565 ms |
1028 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |