Submission #1001938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001938		vjudge1	Watching (JOI13_watching)	C++14	50 / 100	386 ms	262144 KiB

watching

#pragma GCC optimize("O3", "inline")
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
#define int long long int
#define pii pair<int, int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl; return;
#define all(x) x.begin(),x.end()
const int   prime = 23,inf = 2e18,mod = 1e9 +7,sze =1e6;

struct node{
    int qalanbalaca;
    int qalanboyuk;
    int maxgedir;
};


void mal(){
    int n,p,q;
    cin>>n>>p>>q;
    vector<int> arr(n);
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    sort(all(arr));
    int l = 1;
    int r = 1e9+1;
    int ans=r;
    while(l<=r){

        int mid = (l+r)/2;
        int w = mid-1;
        int bigw = mid*2 -1;
        bool check=false;
        int tmx =0;
        vector<vector<vector<int>>> dp(n,vector<vector<int>>(min(n,p),vector<int>(min(n,q)))); // 100*100*100
        vector<vector<int>> mx(min(n,p)+5,vector<int>(min(n,q)+5,-1));
        for(int i=0;i<n;i++){
            for(int j=0;j<=min(n,p);j++){
                for(int k=0;k<=min(n,q);k++){
                    
                    if(j || k){
                        if(j){
                            int y = mx[j-1][k];
                            // yeni p kullanicam
                            if(y>=i-1){
                                int yer = (--upper_bound(all(arr),arr[i] + w)) - arr.begin();
                                mx[j][k]= max(mx[j][k],yer);
                                tmx=max(tmx,mx[j][k]);
                            }
                        }
                        if(k){
                            int y = mx[j][k-1];
                            if(y>=i-1){
                                int yer = (--upper_bound(all(arr),arr[i]+bigw)) - arr.begin();
                                mx[j][k]=max(mx[j][k],yer);
                                tmx=max(tmx,mx[j][k]);
                            }
                        }
                    }
                }
            }
        }
        if(tmx>=n-1){
            check=true;
        }
        
        /*
            i ci yere qeder j dene small, k dene big kullanildi
        */
 
        if(check){
            // cout<<mid<<" "<<w<<" "<<bigw<<endl;
            r=mid-1;
            ans=mid;
        }
        else{
            l=mid+1;
        }

    }
    drop(ans);
}   

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin>>tt;
    
    while(tt--){
        mal();        
    }
}

• Subtask 1: 50 / 50
• Subtask 2: 0 / 50