| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358706 | imchy | Gift Boxes (EGOI25_giftboxes) | C++20 | 111 ms | 27784 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t, n, c;
cin>>t>>n;
vector<vector<int>> con(t);
for(int i=0;i<n;i++){
cin>>c;
con[c].push_back(i);
}
int id1=n, id2=0;
for(int i=0;i<t;i++){
if(con[i].size()>1){
//if(con[i].size()>2){
id1=min(id1, con[i][1]);
int tj=id2;
id2=max(id2, con[i][con[i].size()-1]);
/*}
else{
if(con[i][0]<id1 and con[i][1]>id2){
if(id1-con[i][0]<=con[i][1]-id2){
id1=con[i][0];
if(id2<id1){
id2=id1;
}
}
else{
id2=con[i][1];
if(id1>id2){
id1=id2;
}
}
}
}*/
if(id2==n-1){
id2=max(tj, con[i][con[i].size()-2]);
}
if(id2<id1){
id2=id1;
}
}
}
/*if(n==t+1){
for(int i=0;i<t;i++){
if(con[i].size()>1){
id1=con[i][0];
id2=id1;
}
}
}*/
cout<<id1<<" "<<id2;
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... | ||||
