| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1341111 | aykhn | Gift Boxes (EGOI25_giftboxes) | C++20 | 35 ms | 4176 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t, n;
cin >> t >> n;
int a[n];
for (int &i : a) cin >> i;
vector<int> f(t, 0);
int cnt = 0;
for (int &i : a) f[i]++;
for (int i = 0; i < t; i++) cnt += f[i] > 1;
array<int, 3> res = {0, -1, -1};
for (int l = -1, r = 0; l < n; l++)
{
if (l >= 0)
{
cnt -= f[a[l]] > 1;
f[a[l]]++;
cnt += f[a[l]] > 1;
}
while (r < n && cnt)
{
cnt -= f[a[r]] > 1;
f[a[r]]--;
cnt += f[a[r]] > 1;
r++;
}
if (cnt == 0)
{
res = max(res, {n - (r - l - 1), l + 1, r - 1});
}
}
cout << res[1] << ' ' << res[2] << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
