Submission #1347399

#TimeUsernameProblemLanguageResultExecution timeMemory
1347399msb.83Gift Boxes (EGOI25_giftboxes)C++20
19 / 100
22 ms4352 KiB
//Rahman ve Rahim olan Allah'ın adıyla
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
#define mid (st+end)/2
using namespace std;
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);

    int n,t;cin>>t>>n;vector<int>arr(n);for(int i=0;i<n;i++){cin>>arr[i];}
    int l1,r1,l2,r2;vector<bool>vis(t,false);
    for(l1=0;l1<n;l1++){
        if(vis[arr[l1]]){break;}
        vis[arr[l1]]=true;
    }
    for(r1=n-1;r1>=l1;r1--){
        if(vis[arr[r1]]){break;}
        vis[arr[r1]]=true;
    }vis.clear();vis.resize(t,false);
    for(r2=n-1;r2>=0;r2--){
        if(vis[arr[r2]]){break;}
        vis[arr[r2]]=true;
    }
    for(l2=0;l2<=r2;l2++){
        if(vis[arr[l2]]){break;}
        vis[arr[l2]]=true;
    }if(r2-l2<r1-l1){
        cout<<l2<<" "<<r2;
    }else{
        cout<<l1<<" "<<r1;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...