# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1083565 | serifefedartar | Matching (COCI20_matching) | C++17 | 2 ms | 2908 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;
#define fast ios::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
#define f first
#define s second
#define LOGN 21
const ll MOD = 1e9 + 7;
const ll MAXN = 1e5 + 100;
#define int long long
int x[MAXN], y[MAXN];
set<pair<int,int>> active;
vector<pair<int,int>> ans, P[MAXN];
void check() {
for (int i = 1; i < MAXN; i++) {
if (P[i].size() == 2) {
int x1 = P[i][0].f, x2 = P[i][1].f;
auto u = active.lower_bound({x1, 0});
auto v = active.lower_bound({x2, 1e9});
if (u == v)
ans.push_back({P[i][0].s, P[i][1].s});
else {
auto P1 = active.lower_bound({x1, 0});
auto P2 = active.lower_bound({x2, 0});
if (P1 != active.end() && (*P1).f == 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... |