# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227166 | abeker | Matching (COCI20_matching) | C++17 | 850 ms | 524292 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;
const int MAXV = 2e7 + 5;
struct Node {
int val;
Node* nxt;
};
class Graph {
Node* get_node(int dest, Node* head) {
Node* newNode = new Node;
newNode -> val = dest;
newNode -> nxt = head;
return newNode;
}
int N;
public:
Node **head;
Graph(int N) {
head = new Node*[N]();
this -> N = N;
for (int i = 0; i < N; i++)
head[i] = nullptr;
}
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... |