# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745590 | lukadupli | Mostovi (COI14_mostovi) | C++14 | 393 ms | 14296 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 f first
#define s second
using namespace std;
typedef pair<int, int> pii;
int n, m;
set<int> blok1, blok2;
set<pii> most1, most2;
void most(int a, int b){
if(a > n) swap(a, b);
most1.insert({a, b});
most2.insert({b, a});
}
void blok(int a, int b){
assert(abs(a - b) == 1);
if(a > b) swap(a, b);
if(a <= n) blok1.insert(a);
else blok2.insert(a);
}
bool upit_ista(int a, int b){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |