제출 #976689

#제출 시각아이디문제언어결과실행 시간메모리
976689vjudge1구경하기 (JOI13_watching)C++17
0 / 100
1 ms348 KiB
#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 = 1; i <= n; i++){
        cin >> tol[i - 1];
        tol[i] += tol[i - 1];
    }
    for(int i = 2; i < n; i++){
        if(p >= n || q >= n || p + (q * 1) >= n){
            cout << 1 << endl;
            break;
        }
        else{
            ans =  (p * i) + (q * i * 2);
            if(ans >= n){
                cout << i << endl;
                break;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...