# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285016 | 2020-08-28T08:57:46 Z | achibasadzishvili | Discharging (NOI20_discharging) | C++17 | 437 ms | 85880 KB |
#include<bits/stdc++.h> #define ll long long #define f first #define s second #define pb push_back using namespace std; int n,a[1000002]; ll dp[1000002]; int rm[1000002][21],po[2000002],pw[200],raod,mn,lo,pr[2000002]; int lef[1000002],rig[1000002]; vector<int>del[1000002]; int get(int x,int y){ return pr[y]; } int ind(int x,int y){ if(y == n)return -1; ll l = y + 1,r = n,mid,ind = -1; while(r >= l){ mid = (l + r) / 2; if(dp[x] + (ll)get(x + 1 , mid) * (n - x) > dp[y] + (ll)get(y + 1 , mid) * (n - y)){ r = mid - 1; ind = mid; } else l = mid + 1; } return ind; } void delet(int x){ if(lef[x] == rig[x] && lef[x] == -1)return; if(lef[x] == -1){ lef[rig[x]] = -1; mn = rig[x]; rig[x] = -1; return; } rig[lef[x]] = rig[x]; lef[rig[x]] = lef[x]; int cur = ind(lef[x] , rig[x]); if(cur == -1){ lef[x] = rig[x] = -1; return; } del[cur].pb(lef[x]); lef[x] = rig[x] = -1; } int main(){ scanf("%d",&n); for(int i=1; i<=n; i++){ scanf("%d",&a[i]); pr[i] = max(a[i] , pr[i - 1]); } //cout << clock() - cl << '\n'; for(int i=1; i<=n; i++){ for(int j=0; j<del[i].size(); j++){ delet(del[i][j]); } dp[i] = dp[mn] + (ll)get(mn + 1 , i) * (ll)(n - mn); rig[i - 1] = i; lef[i] = i - 1; ll cur = ind(i - 1 , i); if(cur != -1) del[cur].pb(i - 1); } //cout << "time: " << clock() - cl << " " << raod << '\n'; cout << dp[n]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Incorrect | 16 ms | 23808 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 18 ms | 23936 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 18 ms | 23936 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 392 ms | 85880 KB | Output is correct |
2 | Correct | 385 ms | 81996 KB | Output is correct |
3 | Correct | 399 ms | 81912 KB | Output is correct |
4 | Correct | 383 ms | 81904 KB | Output is correct |
5 | Correct | 383 ms | 81912 KB | Output is correct |
6 | Correct | 437 ms | 81912 KB | Output is correct |
7 | Correct | 378 ms | 81912 KB | Output is correct |
8 | Correct | 385 ms | 81912 KB | Output is correct |
9 | Correct | 383 ms | 81912 KB | Output is correct |
10 | Correct | 378 ms | 82080 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Incorrect | 16 ms | 23808 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 23808 KB | Output is correct |
2 | Incorrect | 16 ms | 23808 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |