# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85820 | teomrn | Synchronization (JOI13_synchronization) | C++14 | 45 ms | 38496 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;
#define NMAX 100010
int x[NMAX + 10], y[NMAX + 10];
int edge_active[NMAX + 10];
namespace AintP {
typedef struct Aint * Arbore;
typedef long long i64;
i64 rand_by_value[NMAX + 10];
struct Aint {
i64 hash = 0;
int suma = 0;
Arbore left = 0, right = 0;
void recalc() {
if (left)
hash ^= left->hash, suma += left->suma;
if (right)
hash ^= right->hash, suma += right->suma;
}
Aint() { }
Aint(int st, int dr, int poz) {
if (st == dr) {
hash = rand() | (rand() << 16);
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... |