| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333870 | eri16 | Gift Boxes (EGOI25_giftboxes) | C++20 | 120 ms | 8240 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll T,N;
cin>>T>>N;
vector <ll> v(N);
vector <ll> freq(T,0);
for (int i=0; i<N; i++){cin>>v[i];freq[v[i]]++;}
ll sm=0;
for (int i=0; i<T; i++){if (freq[i]>1){sm++;}}
ll l=0,r;
ll mx=0;
for (int i=0; i<N; i++){
freq[v[i]]--;
if (freq[v[i]]==1){sm--;}
if (sm==0){
if (N-l-i+1>mx){
mx=N-l-i+1;
r=i;
}
}
}
cout<<l<<' '<<r<<"\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
