# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
495979 | AlperenT | Checker (COCI19_checker) | C++17 | 348 ms | 30540 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;
const int N = 2e5 + 5;
int t, n, a, b, c, lg2[N];
string str;
vector<pair<int, int>> graph[N];
vector<array<int, 3>> edges;
priority_queue<int, vector<int>, greater<int>> pq;
bool flag1 = true, flag2 = true;
bool check(int nodea, int nodeb, int c){
vector<pair<int, int>> v, &va = graph[nodea], &vb = graph[nodeb];
bool flag = false;
if(vb.size() < va.size()) flag = true, swap(va, vb);
if(va.size() * (lg2[vb.size()] + 1) < va.size() + vb.size()){;
for(auto p : va){
auto it = lower_bound(vb.begin(), vb.end(), pair{p.first, 0});
if(it != vb.end()){
pair<int, int> p2 = *it;
Compilation message (stderr)
# | 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... |