# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287941 | Plurm | Discharging (NOI20_discharging) | C++11 | 169 ms | 4344 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;
int n;
int h[1000005];
set<int> active;
class state{
public:
int i, j; // join(i,j); (i < j)
long long diff;
state(int x, int y, long long d) : i(x), j(y), diff(d) {}
friend bool operator<(const state& x, const state& y){
return x.diff > y.diff;
}
};
long long computeDiff(int i, int j){
assert(i < j);
return -1ll*(n-j+1)*h[j] -1ll*(n-i+1)*h[i] + 1ll*(n-i+1)*h[j];
}
bool verifyDiff(state cur){
int i = cur.i;
int j = cur.j;
long long diff = cur.diff;
return active.count(i) && active.count(j) && computeDiff(i,j) == diff;
}
int main(){
scanf("%d",&n);
long long ans = 0ll;
int mx = 0;
vector<int> pivots;
for(int i = 1; i <= n; 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |