# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8237 | ansol4328 | 막대기 (KOI13_game) | C++98 | 96 ms | 4608 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<stdio.h>
#include<stdlib.h>
#include<algorithm>
#define MAXN 100005
struct Stick
{
int t, d, s;
};
Stick m[MAXN];
int cmp(const Stick &a, const Stick &b)
{
return a.t<b.t || (a.t==b.t && a.d<b.d);
}
long long dp[MAXN][2], out;
int n, h, tx[MAXN], dx[MAXN];
int bst(int x)
{
int st, fn, mid;
st=1, fn=n;
while(st<=fn)
{
mid=(st+fn)/2;
if(tx[mid]>x) fn=mid-1;
else if(tx[mid]<x) st=mid+1;
# | 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... |