This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author: shafwanur010
* created: 05/11/2020 6:55:04 PM (Bangladesh Standard Time)
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "header.h"
#else
#include "icc.h"
#endif
void run(int n) {
set<pair<int, int>> st;
while (true) {
for (int u = 1; u <= n; u++) {
for (int v = u + 1; v <= n; v++) {
int a[] = {u};
int b[] = {v};
if (st.count({u, v}) == 0) {
int ret = query(1, 1, a, b);
if (ret) {
setRoad(u, v);
st.emplace(u, v);
}
}
}
}
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |