| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354571 | imchy | Gift Boxes (EGOI25_giftboxes) | C++20 | 767 ms | 72812 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t, n, id1, id2, i1, i2;
cin>>t>>n;
vector<int> c(n);
map<int, int> p, k;
bool b=true;
for(int i=0;i<n;i++){
cin>>c[i];
if(p[c[i]] && b){
id1=i;
b=false;
}
p[c[i]]++;
}
for(int i=0;i<id1;i++){
k[c[i]]++;
}
for(int i=n-1;i>=id1;i--){
if(k[c[i]]){
id2=i;
break;
}
k[c[i]]++;
}
map<int, int> p1, k1;
for(int i=n-1;i>=0;i--){
if(p1[c[i]]){
i1=i;
break;
}
p1[c[i]]++;
}
for(int i=0;i<=i1;i++){
if(k1[c[i]]){
i2=i;
break;
}
k1[c[i]]++;
}
if(id2-id1<i1-i2)
cout<<id1<<" "<<id2;
else
cout<<i2<<" "<<i1;
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
