# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496081 | 600Mihnea | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9017 ms | 11136 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 "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (int) 1e9 + 7;
const int NAX = (int) 1e6 + 7;
int N;
int coef[NAX];
int value[NAX];
bool valid[NAX];
void add(int l, int r, int x) {
for (int j = l; j <= r; j++) {
value[j] += x;
}
}
int getMax() {
int sol = 0;
for (int i = 1; i <= N; i++) {
sol = max(sol, value[i]);
}
return sol;
}
vector<int> innterCountScans(vector<ll> a, vector<int> pos, vector<ll> ChangeValue) {
int n = (int) a.size();
# | 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... |