Submission #713381

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7133812023-03-21 20:09:31mtxasRabbit Carrot (LMIO19_triusis)C++14
14 / 100
289 ms185940 KiB
#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));
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...