| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1355933 | mahriban | Gift Boxes (EGOI25_giftboxes) | C++20 | 68 ms | 2848 KiB |
#include<bits/stdc++.h>
using namespace std;
bool vis[500009];
int a[500009];
int main(){
int n, m;
cin >> n >> m;
int l = 500009, r = -1, ok = 0;
for (int i = 1; i <= m; i ++){
cin >> a[i];
if (vis[a[i]]){l = min(l, i - 1);ok = 1;}
if (!ok)vis[a[i]] = 1;
}
for (int i = m; i >= 0; i --){
if (vis[a[i]]){r = max(r, i - 1);break;}
vis[a[i]] = 1;
}
cout << l << ' ' << r << endl;
}| # | 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... | ||||
