oj.uz

Submission #976944

# Submission time Handle Problem Language Result Execution time Memory
976944 2024-05-07T09:30:13 Z vjudge1 Watching (JOI13_watching) C++17
0 / 100
 108 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

const int maks = 1e9 + 7;
int main(){
    int n, p, q, ans;
    cin >> n >> p >> q;
    long long tol[n];
    for(int i = 0; i < n; i++){
        cin >> tol[i];
    }sort(tol, tol + n);
    ans = tol[n - 1] - tol[0] - n + 1;
    for(int i = 1; i < maks ; i++){
        if((p * i) + (q * 2 * i) >= ans){
            cout << i << endl;
            break;
        }
    }
}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

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