oj.uz

답안 #468182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468182 2021-08-27T01:54:59 Z pdstiago 구경하기 (JOI13_watching) C++14
0 / 100
 1000 ms 424 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define MOD 1000000007
#define mxn 2005
#define mxm 1005
#define f first
#define s second
#define pb push_back
#define es " "
#define endl '\n'
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define ll long long
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef pair<ll, ll> pii;
typedef pair<pii, int> pip;
 
int n, v[mxn], p, g;
 
int solve(int i, int ss, int b, int last, int maxx){
    if(ss<0 || b<0){
        return 0;
    }
    if(ss+b<=0 && i<=n){
        return 0;
    }
    if(i>n){
        if(ss+b>=0 && last>n){
            return 1;
        }else{
            return 0;
        }
    }
    int ans=0;
    if(v[i]-v[last]+1<=2*maxx){
        if(v[i]-v[last]+1<=maxx){
            ans=max(ans, solve(i+1, ss-1, b, i+1, maxx));
        }else{
            ans=max(ans, solve(i+1, ss, b-1, i+1, maxx));
        }
    }
    ans=max(ans, solve(i+1, ss, b, last, maxx));
    return ans;
}
 
int main(){
    fastio;
    cin >> n >> p >> g;
    for(int i=1; i<=n; i++){
        cin >> v[i];
    }
    sort(v+1, v+1+n);
    int ini=1, fim=1000000000, meio, resp;
    while(ini<=fim){
        meio=(ini+fim)>>1;
        if(solve(1, p, g, 1, meio)){
            resp=meio;
            fim=meio-1;
        }else{
            ini=meio+1;
        }
    }
    cout << resp;
    return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:66:13: warning: 'resp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   66 |     cout << resp;
      |             ^~~~

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Execution timed out 1085 ms 204 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 445 ms 424 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -