# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227022 | abeker | Matching (COCI20_matching) | C++17 | 2604 ms | 435388 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;
typedef pair <int, int> pii;
const int MAXN = 1e5 + 5;
const int offset = 1 << 17;
class TwoSat {
const static int MAXV = 1e7 + 5;
int n;
vector <int> sol;
vector <bool> bio;
vector <int> comp;
vector <vector <int>> adj, rev;
int order[MAXV];
int stackSize;
public:
int add_variables(int vars) {
n += vars;
for (int i = 0; i < 2 * vars; i++) {
sol.push_back(0);
bio.push_back(false);
comp.push_back(0);
adj.push_back(vector <int> ());
rev.push_back(vector <int> ());
}
return n - vars;
}
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... |