# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103946 | vladilius | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9058 ms | 25240 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 pb push_back
const int inf = 1e9;
struct ST{
vector<int> a;
int n;
ST(int ns){
n = ns;
a.resize(n + 1);
}
void add(int l, int r, int x){
for (int i = l; i <= r; i++){
a[i] += x;
}
}
int get(){
int mx = 0;
for (int i = 1; i <= n; i++){
mx = max(mx, a[i]);
}
return mx;
}
};
vector<int> countScans(vector<int> a, vector<int> p, vector<int> x){
a.insert(a.begin(), 0);
p.insert(p.begin(), 0);
x.insert(x.begin(), 0);
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... |