| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1363256 | husseinjuanda | Gift Boxes (EGOI25_giftboxes) | C++20 | 31 ms | 15948 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t, n; cin >> t >> n;
vector<int> x(n);
vector<int> mx(t);
for(int i = 0; i < n; i++){
cin >> x[i];
mx[x[i]] = i;
}
int s = 0;
vector<int> freq(t);
for(int i = n-1; i >= 0; i--){
freq[x[i]]++;
if(freq[x[i]] == 2) break;
s = i;
}
int m = s-1;
int mn = 1e18;
int l, r;
vector<int> f(t);
for(int i = 0; i < n; i++){
if(mn > m - i + 1){
mn = m-i+1;
l = i;
r = m;
}
f[x[i]]++;
if(f[x[i]] > 1) break;
m = max(mx[x[i]], m);
}
cout << l << " " << r << endl;
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... | ||||
