# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867620 | NeroZein | Constellation 3 (JOI20_constellation3) | C++17 | 318 ms | 60436 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"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int N = 2e5 + 5;
int a[N];
int x[N], y[N], c[N];
int leaf[N];
int L[N], R[N];
long long dp[N];
int prop[N * 2];
vector<int> g[N];
long long tree[N];
vector<int> in_col[N];
int cnt, in[N], out[N];
vector<pair<int, int>> vec[N];
map<pair<int, int>, vector<pair<int, int>>> mp;
int search(vector<int>& mono, int v) {
int lo = 0, hi = (int) mono.size() - 1;
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
if (a[mono[mid]] >= v) lo = mid;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |