# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21011 | model_code | Long Distance Coach (JOI17_coach) | C++11 | 419 ms | 20716 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 <cstdio>
#include <cstdlib>
#include <set>
#include <functional>
#include <algorithm>
using namespace std;
typedef long long Int;
const int MAXN = 500050;
const Int INFLL = 1001001001001001001LL;
template<typename T> void chmin(T& a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T& a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
Int lin() { Int x; scanf("%lld", &x); return x; }
struct CHT {
typedef pair<Int, Int> line;
struct comp {
bool operator() (const line& a, const line& b) {
return a.first != b.first ? a.first > b.first : a.second < b.second;
}
};
set<line, comp> lines;
CHT() {
lines.emplace(INFLL, INFLL);
lines.emplace(0, INFLL + 1);
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... |