# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090144 | ZeroCool | Lottery (CEOI18_lot) | C++14 | 334 ms | 8528 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;
//#define int long long
#define ll long long
#define ar array
//const int INF = 1e17;
const int N = 1e4 + 5;
const int Q = 105;
const int MOD = 1e9 + 7;
int A[N], que[N], B[Q], id[N], pref[N], ans[N][Q];
signed main(){ios_base::sync_with_stdio(false);cin.tie(0);
int n, l;
cin>>n>>l;
for(int i = 1;i <= n;i++)cin>>A[i];
int q;
cin>>q;
for(int i = 1;i <= q;i++){
cin>>que[i];
//--que[i];
B[i] = que[i];
}
sort(B + 1, B + q + 1);
int j = 0;
for(int i = 1;i <= n;i++){
while(j <= q && B[j] < 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... |