| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354796 | imchy | Gift Boxes (EGOI25_giftboxes) | C++20 | 494 ms | 49152 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t, n, id1=0, id2=0;
cin>>t>>n;
vector<int> c(n);
map<int, int> p;
for(int i=0;i<n;i++){
cin>>c[i];
}
int i=0, j=n-1;
while(!id1 || !id2){
if(p[c[i]] && !id1){
id1=i+1;
}
if(p[c[j]] && !id2){
id2=j+1;
}
p[c[i]]=i+1;
p[c[j]]=j+1;
i++;
j--;
}
map<int, int> k;
int j1, j2;
for(i=0;i<n;i++){
if(k[c[i]]){
j1=i;
break;
}
}
for(j=n-1;j>=0;j--){
if(k[c[i]]){
j2=j;
break;
}
}
if(abs(id2-id1)<abs(j2-j1))
cout<<min(id1-1, id2-1)<<" "<<max(id1-1, id2-1);
else
cout<<min(j1, j2)<<" "<<max(j1, j2);
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... | ||||
