# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127011 | MinhKien | Plahte (COCI17_plahte) | C++20 | 2118 ms | 554988 KiB |
#include <algorithm>
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#define ii pair <int, int>
#define iii pair <ii, int>
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 10;
int n, m, ans[N];
set <int> s[N];
vector <int> v[N];
bool IsRoot[N];
struct rect {
int x1, y1, x2, y2;
int id, k;
void input(int i) {
if (i <= n) {
cin >> x1 >> y1 >> x2 >> y2;
k = -1;
} else {
cin >> x1 >> y1 >> k;
x2 = x1;
# | 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... |