oj.uz

Submission #976716

# Submission time Handle Problem Language Result Execution time Memory
976716 2024-05-07T03:48:47 Z vjudge1 Watching (JOI13_watching) C++17
0 / 100
 1 ms 756 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n, p, q;
    cin >> n >> p >> q;
    long long ans, tol[n + 5];
    for(int i = 0; i < n; i++){
        cin >> tol[i];
    }sort(tol, tol + n + 5);
    ans = tol[n - 1] - tol[0] - 1 - n;
    for(int i = 1; i < n; 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 1 ms 756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

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