# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369459 | pure_mem | Wall (IOI14_wall) | C++14 | 850 ms | 140224 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 "wall.h"
#include <utility>
#include <algorithm>
#define ll long long
#define X first
#define Y second
#define MP make_pair
using namespace std;
const int N = 2e6 + 12;
const int INF = 1e6;
pair<int, int> t[N * 4], tt[N * 4];
int fin[N];
pair<int, int> merge(pair<int, int> x, pair<int, int> y){
if(y == MP(0, INF))
return x;
if(y.Y <= x.X)
return MP(x.X, x.X);
if(x.Y <= y.X)
return MP(x.Y, x.Y);
if(x.X <= y.X && y.X <= x.Y)
x.X = y.X;
if(x.X <= y.Y && y.Y <= x.Y)
x.Y = y.Y;
return x;
}
# | 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... |