# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70965 | MatheusLealV | Lottery (CEOI18_lot) | C++17 | 1800 ms | 9788 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>
#define N 10030
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
pii q[N];
int n, dx, qq, v[N], c, zero[N], k[N], nxt[2*N], id[150];
int pref[N][130];
bool out(int i, int j)
{
int l = i + dx - 1;
int r = j + dx - 1;
if(l > n or r > n or j < 1 or j <= i) return true;;
return false;
}
inline void solveD(int fl, vector<int>& vet)
{
int i = 1, j = fl, id;
c = i - j;
# | 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... |