# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223105 | MKopchev | Lottery (CEOI18_lot) | C++14 | 1150 ms | 8440 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 nmax=1e4+42,qmax=1e2+5;
int n,l;
int inp[nmax];
pair<int/*k*/,int/*id*/> queries[nmax];
int where_begins[nmax];
int pref[nmax];
int output[qmax][nmax];
int original[nmax];
int q;
int main()
{
scanf("%i%i",&n,&l);
for(int i=1;i<=n;i++)scanf("%i",&inp[i]);
scanf("%i",&q);
for(int i=1;i<=q;i++)
{
scanf("%i",&queries[i].first);
queries[i].second=i;
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... |