# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
809223 | 2023-08-05T22:19:50 Z | HaroldVemeno | Measures (CEOI22_measures) | C++17 | 1500 ms | 3820 KB |
#include <bits/stdc++.h> #ifdef GUDEB #define D(x) cerr << #x << ": " << (x) << '\n'; #define ifdeb if(true) #else #define D(x) ; #define ifdeb if(false) #endif #define all(x) begin(x), end(x) using namespace std; using ull = unsigned long long; using ll = long long; // #define int ll; int n, m, d; vector<int> as; vector<int> bs; void solve() { cin >> n >> m >> d; as.resize(n); bs.resize(m); for(int i = 0; i < n; ++i) cin >> as[i]; for(int i = 0; i < m; ++i) cin >> bs[i]; for(int i = 0; i < m; ++i) { as.push_back(bs[i]); sort(all(as)); ll time = 0; ll b = as[0]; for(int j = 1; j < as.size(); ++j) { time = max(time, 0ll+d-as[j]+b); b = max(b+d, 1ll*as[j]); } cout << time/2; if(time&1) cout << ".5"; cout << ' '; } cout << '\n'; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed; solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 336 KB | Output is correct |
6 | Correct | 2 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 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 | 336 KB | Output is correct |
6 | Correct | 2 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 99 ms | 3820 KB | Output is correct |
10 | Correct | 142 ms | 3764 KB | Output is correct |
11 | Correct | 56 ms | 3780 KB | Output is correct |
12 | Correct | 148 ms | 3788 KB | Output is correct |
13 | Correct | 40 ms | 3284 KB | Output is correct |
14 | Correct | 92 ms | 3792 KB | Output is correct |
15 | Correct | 92 ms | 3156 KB | Output is correct |
16 | Correct | 57 ms | 3796 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1570 ms | 1420 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1570 ms | 1420 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |