Submission #1370402

#TimeUsernameProblemLanguageResultExecution timeMemory
1370402ElayV13Gift Boxes (EGOI25_giftboxes)C++20
0 / 100
2095 ms58912 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF=1e18;
void solve(){
    int tcnt,n;
    cin>>tcnt>>n;
    vector<int>a(n);
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    map<int,int>mp;
    vector<vector<int>>all;
    for(int i=0;i<n;i++){
        mp[a[i]]++;
        if(mp[a[i]]==2) break;
        int l=i+1,r=n-1,mn=INF;
        while(l<=r){
            int mid=(l+r)>>1;
            bool f=1;
            map<int,int>cnt;
            for(int j=mid+1;j<n;j++){
                if(mp[a[j]]>0) f=0;
                cnt[a[j]]++;
                if(cnt[a[j]]==2) f=0;
            }
            if(f){
                mn=min(mn,mid);
                r=mid-1;
            }
            else l=mid+1;
        }
        all.push_back({mn-i,i+1,mn});
    }
    sort(all.begin(),all.end());
    cout<<all[0][1]<<' '<<all[0][2]<<endl;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T=1;//cin>>T;
    while(T--) solve();
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...