oj.uz

Submission #521963

# Submission time Handle Problem Language Result Execution time Memory
521963 2022-02-03T14:01:54 Z DanerZein Discharging (NOI20_discharging) C++14
47 / 100
 1000 ms 59856 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N=1e6+10;
const int MAX_P=MAX_N*4;
const int MAX=1e9;
ll val[MAX_N];
int tr[MAX_P];
ll n;
int unir(int a,int b){
  if(a==n || b==n){
    if(a==n) return b;
    if(b==n) return a;
    return n;
  }
  if(val[a]>val[b]) return a;
  else{
    if(val[a]==val[b]) return min(a,b);
    else return b;
  }
}
void init(int node,int a,int b){
  if(a==b){
    tr[node]=a;
    return;
  }
  int mid=(a+b)/2,le=2*node+1,ri=2*node+2;
  init(le,a,mid);
  init(ri,mid+1,b);
  tr[node]=unir(tr[le],tr[ri]);
}
ll query(int node,int a,int b,int l,int r){
  if(b<l || a>r) return n;
  if(l<=a && r>=b) return tr[node];
  int mid=(a+b)/2,le=2*node+1,ri=2*node+2;
  return unir(query(le,a,mid,l,r),query(ri,mid+1,b,l,r));
}
ll dp[MAX_N];
ll maxres(int l,int r){
  if(dp[r]!=-1) return dp[r];
  int i=query(0,0,n-1,0,r);
  if(i==0) return val[i]*n;
  ll d=(n-i);
  ll ans=val[i]*n;
  for(int k=i-1;k>=0;k--){
    ans=min(ans,val[i]*d+maxres(0,k));
    d++;
  }
  return dp[r]=ans;
}
int main(){
  memset(dp,-1,sizeof dp);
  cin>>n;
  for(int i=0;i<n;i++){
    int a; cin>>a;
    val[i]=a;
  }
  val[n]=-MAX;
  init(0,0,n-1);
  cout<<maxres(0,n-1)<<endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8012 KB Output is correct
2 Correct 3 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 3 ms 8012 KB Output is correct
5 Correct 3 ms 8012 KB Output is correct
6 Correct 3 ms 8012 KB Output is correct
7 Correct 3 ms 8012 KB Output is correct
8 Correct 3 ms 8012 KB Output is correct
9 Correct 4 ms 8084 KB Output is correct
10 Correct 4 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 4 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8044 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8216 KB Output is correct
2 Correct 12 ms 8240 KB Output is correct
3 Correct 9 ms 8264 KB Output is correct
4 Correct 10 ms 8140 KB Output is correct
5 Correct 11 ms 8484 KB Output is correct
6 Correct 22 ms 8132 KB Output is correct
7 Correct 12 ms 8140 KB Output is correct
8 Correct 6 ms 8264 KB Output is correct
9 Correct 5 ms 8268 KB Output is correct
10 Correct 6 ms 8268 KB Output is correct
11 Correct 6 ms 8268 KB Output is correct
12 Correct 8 ms 8268 KB Output is correct
13 Correct 7 ms 8264 KB Output is correct
14 Correct 10 ms 8268 KB Output is correct
15 Correct 19 ms 8372 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8216 KB Output is correct
2 Correct 12 ms 8240 KB Output is correct
3 Correct 9 ms 8264 KB Output is correct
4 Correct 10 ms 8140 KB Output is correct
5 Correct 11 ms 8484 KB Output is correct
6 Correct 22 ms 8132 KB Output is correct
7 Correct 12 ms 8140 KB Output is correct
8 Correct 6 ms 8264 KB Output is correct
9 Correct 5 ms 8268 KB Output is correct
10 Correct 6 ms 8268 KB Output is correct
11 Correct 6 ms 8268 KB Output is correct
12 Correct 8 ms 8268 KB Output is correct
13 Correct 7 ms 8264 KB Output is correct
14 Correct 10 ms 8268 KB Output is correct
15 Correct 19 ms 8372 KB Output is correct
16 Execution timed out 1090 ms 59856 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 24056 KB Output is correct
2 Correct 378 ms 24156 KB Output is correct
3 Correct 399 ms 24028 KB Output is correct
4 Correct 406 ms 24140 KB Output is correct
5 Correct 394 ms 24100 KB Output is correct
6 Correct 393 ms 24104 KB Output is correct
7 Correct 397 ms 24048 KB Output is correct
8 Correct 412 ms 24068 KB Output is correct
9 Correct 369 ms 24136 KB Output is correct
10 Correct 413 ms 24192 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8012 KB Output is correct
2 Correct 3 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 3 ms 8012 KB Output is correct
5 Correct 3 ms 8012 KB Output is correct
6 Correct 3 ms 8012 KB Output is correct
7 Correct 3 ms 8012 KB Output is correct
8 Correct 3 ms 8012 KB Output is correct
9 Correct 4 ms 8084 KB Output is correct
10 Correct 4 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 4 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8044 KB Output is correct
15 Correct 7 ms 8216 KB Output is correct
16 Correct 12 ms 8240 KB Output is correct
17 Correct 9 ms 8264 KB Output is correct
18 Correct 10 ms 8140 KB Output is correct
19 Correct 11 ms 8484 KB Output is correct
20 Correct 22 ms 8132 KB Output is correct
21 Correct 12 ms 8140 KB Output is correct
22 Correct 6 ms 8264 KB Output is correct
23 Correct 5 ms 8268 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 8 ms 8268 KB Output is correct
27 Correct 7 ms 8264 KB Output is correct
28 Correct 10 ms 8268 KB Output is correct
29 Correct 19 ms 8372 KB Output is correct
30 Correct 26 ms 8136 KB Output is correct
31 Correct 17 ms 8140 KB Output is correct
32 Correct 14 ms 8140 KB Output is correct
33 Correct 13 ms 8140 KB Output is correct
34 Correct 21 ms 8168 KB Output is correct
35 Correct 26 ms 8136 KB Output is correct
36 Correct 10 ms 8140 KB Output is correct
37 Correct 14 ms 8140 KB Output is correct
38 Correct 29 ms 8140 KB Output is correct
39 Correct 17 ms 8168 KB Output is correct
40 Correct 10 ms 8136 KB Output is correct
41 Correct 19 ms 8152 KB Output is correct
42 Correct 19 ms 8140 KB Output is correct
43 Correct 11 ms 8128 KB Output is correct
44 Correct 18 ms 8172 KB Output is correct
45 Correct 18 ms 8132 KB Output is correct
46 Correct 24 ms 8140 KB Output is correct
47 Correct 30 ms 8148 KB Output is correct
48 Correct 13 ms 8136 KB Output is correct
49 Correct 11 ms 8140 KB Output is correct
50 Correct 8 ms 8140 KB Output is correct

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8012 KB Output is correct
2 Correct 3 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 3 ms 8012 KB Output is correct
5 Correct 3 ms 8012 KB Output is correct
6 Correct 3 ms 8012 KB Output is correct
7 Correct 3 ms 8012 KB Output is correct
8 Correct 3 ms 8012 KB Output is correct
9 Correct 4 ms 8084 KB Output is correct
10 Correct 4 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 4 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8044 KB Output is correct
15 Correct 7 ms 8216 KB Output is correct
16 Correct 12 ms 8240 KB Output is correct
17 Correct 9 ms 8264 KB Output is correct
18 Correct 10 ms 8140 KB Output is correct
19 Correct 11 ms 8484 KB Output is correct
20 Correct 22 ms 8132 KB Output is correct
21 Correct 12 ms 8140 KB Output is correct
22 Correct 6 ms 8264 KB Output is correct
23 Correct 5 ms 8268 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 8 ms 8268 KB Output is correct
27 Correct 7 ms 8264 KB Output is correct
28 Correct 10 ms 8268 KB Output is correct
29 Correct 19 ms 8372 KB Output is correct
30 Execution timed out 1090 ms 59856 KB Time limit exceeded
31 Halted 0 ms 0 KB -