oj.uz

답안 #862908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862908 2023-10-19T11:05:21 Z Trisanu_Das Measures (CEOI22_measures) C++17
10 / 100
 1500 ms 5464 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n, m, d; cin >> n >> m >> d;
    vector<int> points (n);
    for (int i = 0; i < n; i++) cin >> points[i];
    for (int i = 0; i < m; i++) {
        int nouveau, reponse = 0; cin >> nouveau;
        points.push_back(nouveau);
        sort(points.begin(), points.end());
        for (int a = 0; a < (int)points.size(); a++) for (int b = a+1; b < (int)points.size(); b++) reponse = max(reponse, ((d * (b-a)) - (points[b] - points[a])));
        cout << (reponse - reponse % 2) / 2;
        if (reponse % 2) cout << ".5";
        cout << ' ';
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 19 ms 348 KB Output is correct
4 Correct 20 ms 348 KB Output is correct
5 Correct 19 ms 500 KB Output is correct
6 Correct 20 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 19 ms 344 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 19 ms 348 KB Output is correct
4 Correct 20 ms 348 KB Output is correct
5 Correct 19 ms 500 KB Output is correct
6 Correct 20 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 19 ms 344 KB Output is correct
9 Execution timed out 1516 ms 5464 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1547 ms 476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1547 ms 476 KB Time limit exceeded
2 Halted 0 ms 0 KB -