# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383624 | rumen_m | Lottery (CEOI18_lot) | C++17 | 3092 ms | 4460 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;
const int maxn = 1e4+5;
int a[maxn];
int calc(int x, int y, int l)
{
int sum = 0;
int i;
for(i=0;i<l;i++)
{
if(a[x+i]!=a[y+i])sum++;
}
return sum;
}
struct queries
{
int idx;
int p[maxn];
int k;
};
queries q[105];
bool cmp(queries i, queries j)
{
return i.k>j.k;
}int Q;
void add(int x, int v)
{
int i;
for(i=1;i<=Q;i++)
{
# | 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... |