oj.uz

답안 #723368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723368 2023-04-13T16:16:25 Z t_holl Measures (CEOI22_measures) C++14
10 / 100
 1500 ms 2428 KB 
#include <bits/stdc++.h>

using namespace std;
#define num long long
int N, M; num D;

num compute (vector<num> &res) {
    num ans = 0;

    for (int i = 0; i < res.size(); i ++)
        for (int j = i; j < res.size(); j ++)
            ans = max(ans, D * (j - i) - res[j] + res[i]);

    return ans;
}

int main() {
    cin >> N >> M >> D;

    vector<num> res;
    for (int i = 0; i < N; i ++) {
        num x; cin >> x;
        res.push_back(x);
    }
    for (int i = 0; i < M; i ++) {
        num x; cin >> x;
        res.push_back(x);

        sort(res.begin(), res.end());
        num total = compute(res);
        cout << total / 2;
        if (total % 2 == 1) cout << ".5";

        cout << " ";
    }

    cout << endl;

    return 0;
}

Compilation message

Main.cpp: In function 'long long int compute(std::vector<long long int>&)':
Main.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < res.size(); i ++)
      |                     ~~^~~~~~~~~~~~
Main.cpp:11:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |         for (int j = i; j < res.size(); j ++)
      |                         ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 212 KB Output is correct
2 Correct 28 ms 212 KB Output is correct
3 Correct 22 ms 212 KB Output is correct
4 Correct 21 ms 212 KB Output is correct
5 Correct 21 ms 212 KB Output is correct
6 Correct 23 ms 324 KB Output is correct
7 Correct 22 ms 212 KB Output is correct
8 Correct 25 ms 212 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 212 KB Output is correct
2 Correct 28 ms 212 KB Output is correct
3 Correct 22 ms 212 KB Output is correct
4 Correct 21 ms 212 KB Output is correct
5 Correct 21 ms 212 KB Output is correct
6 Correct 23 ms 324 KB Output is correct
7 Correct 22 ms 212 KB Output is correct
8 Correct 25 ms 212 KB Output is correct
9 Execution timed out 1570 ms 2428 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

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

Subtask #4
0 / 41.0

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