# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162141 | Akashi | Lottery (CEOI18_lot) | C++14 | 2982 ms | 8568 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.
///better top wins
#include <bits/stdc++.h>
using namespace std;
struct query{
int x, p;
bool operator < (const query &aux)const{
if(x != aux.x) return x < aux.x;
return p < aux.p;
}
};
query q[105];
int n, l, t;
int a[10005], f[10005];
int dp[10005][105];
void add(int p, int x){
int st = 1, dr = t;
while(st <= dr){
int mij = (st + dr) / 2;
if(q[mij].x < x) st = mij + 1;
else dr = mij - 1;
}
if(q[st].x == x) ++dr;
if(x > q[dr].x) ++dr;
if(dr > t) return ;
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... |