# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411781 | Malheiros | Synchronization (JOI13_synchronization) | C++17 | 510 ms | 24444 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;
const int maxn=1e5+10;
const int maxlog=20;
#define ll long long
struct fenwick{
ll* arr;
int size;
fenwick(int v){
int n=v;
arr= new ll[n+1];
size=n;
for (int i=0;i<=n+1;i++) arr[i]=0;
}
fenwick(vector<int>& v){
int n=v.size();
arr = new ll[n+1];
size=n;
for (int i=0;i<n;i++){
arr[i+1]=v[i];
}
build();
}
void build () {
for (int i=1;i<=size;i++){
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... |