# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925128 | Camillus | Floppy (RMI20_floppy) | C++17 | 1043 ms | 36124 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"
#pragma GCC optimize("O3")
using namespace std;
#ifndef LOCAL
#include "floppy.h"
#else
void read_array(int subtask_id, const vector<int> &v);
void save_to_floppy(const string &bits);
vector<int> solve_queries(int subtask_id, int N, const string &bits, const vector<int> &a, const vector<int> &b);
#endif
struct segment_tree {
int n;
vector<int> tree;
segment_tree(int n) : n(n) {
tree.resize(4 * n);
}
void set(int i, int v, int x = 0, int lx = 0, int rx = -1) {
if (rx == -1) {
rx = n;
}
if (rx - lx == 1) {
tree[x] = v;
return;
}
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... |