# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159567 | geon040702 | 장애물 경기 (KOI16_dd) | C++14 | 145 ms | 12920 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>
#define MAX 999999999
using namespace std;
struct Item
{
int x, y[2];
bool operator<(const Item &r) const {
return x < r.x;
}
};
int n, start_y, end_x;
Item hurdle[100010];
set< pair<int,int> > data1;
int data2[100010];
void calc_route()
{
int i, j, temp[2];
int ans = MAX, cnt = 0;
set< pair<int, int> >::iterator pos, st, ed;
data1.insert(make_pair(start_y, 0));
for(i = 1 ; i <= n ; i++)
{
temp[0] = temp[1] = MAX;
st = data1.lower_bound(make_pair(hurdle[i].y[0], 0));
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... |