# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95184 | Retro3014 | Lottery (CEOI18_lot) | C++17 | 1684 ms | 6776 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 <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
#define MAX_N 100000
#define MAX_Q 100
using namespace std;
int N, L, Q;
//short ans[MAX_Q+1][MAX_N+1];
short calc2[MAX_Q+1][MAX_N+1];
int v[MAX_N+1];
struct Query{
Query (int idx, int data) : idx(idx), data(data) {}
int idx, data;
bool operator <(const Query &a)const{
return data<a.data;
}
};
vector<Query> query;
vector<int> q;
void calc(int x, int y){
y = lower_bound(q.begin(), q.end(), y)-q.begin();
calc2[y][x]++;
}
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... |