# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314121 | phathnv | Konj (COCI19_konj) | C++11 | 108 ms | 16504 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 mp make_pair
#define X first
#define Y second
#define taskname "KONJ"
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 2e5 + 1;
const int D = 301;
struct lineSegment{
int a, b, c, d;
bool contains(int x, int y){
return (a <= x && x <= c && b <= y && d <= b);
}
};
struct data{
int x, y, ind;
data(int _x, int _y, int _ind){
x = _x;
y = _y;
ind = _ind;
}
};
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |