# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238210 | Sorting | Restore Array (RMI19_restore) | C++14 | 9 ms | 640 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 k_N = 5000 + 3;
const int k_M = 10000 + 3;
struct Constraint{
int l, r, k, value;
Constraint(){}
Constraint(int l, int r, int k, int value){
this->l = l;
this->r = r;
this->k = k;
this->value = value;
}
};
int n, m;
int a[k_N];
Constraint c[k_M];
int prefix[k_N];
int get_count_ones(int l, int r){
if(l == 0)
return prefix[r];
return prefix[r] - prefix[l - 1];
}
# | 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... |