# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908662 | Dec0Dedd | Lottery (CEOI18_lot) | C++14 | 1649 ms | 8588 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;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e4+50;
const int Q = 110;
vector<pii> que;
vector<int> q2;
int n, l, q, ans[Q][N], a[N];
void add(int x, int df) {
int ptr=lower_bound(que.begin(), que.end(), make_pair(df, -1))-que.begin();
++ans[ptr][x];
}
bool cmp(pii a, pii b) {
return a.second < b.second;
}
void solve() {
cin>>n>>l;
for (int i=1; i<=n; ++i) cin>>a[i];
cin>>q;
for (int i=1; i<=q; ++i) {
int k; cin>>k;
# | 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... |