oj.uz

Submission #723387

# Submission time Handle Problem Language Result Execution time Memory
723387 2023-04-13T16:31:33 Z rnl42 Measures (CEOI22_measures) C++14
0 / 100
 1500 ms 344 KB 
#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;
        auto it = lower_bound(A.begin(), A.end(), in);
        A.insert(it, in);
        int ans = 0;
        for (int i = 0; i < (int)A.size(); i++) {
            for (int j = i+1; j < (int)A.size(); j++) {
                ans = max(ans, (j-i)*D-(A[j]-A[i]));
            }
        }
        cout << (ans>>1); if (ans & 1) cout << ".5";
        cout << (i == M-1 ? '\n' : ' ');
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1560 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1560 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -