# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112954 | luciocf | Lottery (CEOI18_lot) | C++14 | 688 ms | 8568 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 ff first
#define ss second
using namespace std;
const int maxn = 1e4+10;
const int maxq = 110;
typedef pair<int, int> pii;
int a[maxn];
int first[maxn];
int ans[maxn][maxq];
pii query[maxq];
int main(void)
{
int n, l;
scanf("%d %d", &n, &l);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int q;
scanf("%d", &q);
Compilation message (stderr)
# | 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... |