# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713381 | mtxas | Rabbit Carrot (LMIO19_triusis) | C++14 | 289 ms | 185940 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void solve()
{
const int inf = 0x3f3f3f3f;
int n, m;
cin >> n >> m;
if(n > 5000)
{
assert(false);
}
vector<int> a(n + 1);
for(int i = 1; i <= n; ++i)
{
cin >> a[i];
}
/// calculate c
set<int> s;
for(int i = 1; i <= n; ++i)
{
s.insert(a[i]);
s.insert(a[i] + 1);
s.insert(max(0, a[i] - 1));
s.insert(a[i] + m);
s.insert(a[i] + m + 1);
s.insert(max(0, a[i] + m - 1 ));
s.insert(max(0, a[i] - m));
s.insert(max(0, a[i] - m + 1));
s.insert(max(0, a[i] - m - 1));
}
# | 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... |