| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 600292 | GusterGoose27 | Synchronization (JOI13_synchronization) | C++11 | 0 ms | 212 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;
const int MAXM = 2e5;
bitset<MAXN> bsets[MAXN];
class stree {
public:
int lt, rt;
stree *l = nullptr;
stree *r = nullptr;
vector<pii> merges;
stree(int lp, int rp) {
lt = lp;
rt = rp;
if (rp > lp) {
int m = (lt+rt)/2;
l = new stree(lt, m);
r = new stree(m+1, rt);
}
}
void update(pii &m, int lm, int rm) {
if (lt > rm || rt < lm) return;
}
};
int main() {
ios_base::sync_with_stdio(false);
}| # | 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... | ||||
