# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99625 | Anai | Lottery (CEOI18_lot) | C++14 | 553 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 N = 10000, Q = 101;
int v[2 * N], map_q[N], ant[Q][N];
map<int, int> mq;
vector<int> qs;
int n, l, q;
int main() {
#ifdef HOME
freopen("lot.in", "r", stdin);
freopen("lot.out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int tmp = 0;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
cin >> v[i];
v[i + n] = v[i]; }
cin >> q;
qs.resize(q);
for (int i = 0; i < q; ++i) {
cin >> qs[i];
mq[qs[i]] = 0; }
# | 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... |