oj.uz

Submission #521965

# Submission time Handle Problem Language Result Execution time Memory
521965 2022-02-03T14:03:02 Z DanerZein Discharging (NOI20_discharging) C++14
47 / 100
 1000 ms 54908 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(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  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 4 ms 8140 KB Output is correct
2 Correct 3 ms 8140 KB Output is correct
3 Correct 3 ms 8140 KB Output is correct
4 Correct 3 ms 8140 KB Output is correct
5 Correct 3 ms 8140 KB Output is correct
6 Correct 3 ms 8140 KB Output is correct
7 Correct 3 ms 8140 KB Output is correct
8 Correct 4 ms 8140 KB Output is correct
9 Correct 3 ms 8140 KB Output is correct
10 Correct 3 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 3 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8268 KB Output is correct
2 Correct 11 ms 8268 KB Output is correct
3 Correct 8 ms 8268 KB Output is correct
4 Correct 9 ms 8272 KB Output is correct
5 Correct 11 ms 8288 KB Output is correct
6 Correct 20 ms 8152 KB Output is correct
7 Correct 14 ms 8268 KB Output is correct
8 Correct 5 ms 8268 KB Output is correct
9 Correct 5 ms 8268 KB Output is correct
10 Correct 5 ms 8268 KB Output is correct
11 Correct 5 ms 8268 KB Output is correct
12 Correct 8 ms 8268 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 11 ms 8184 KB Output is correct
15 Correct 12 ms 8268 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8268 KB Output is correct
2 Correct 11 ms 8268 KB Output is correct
3 Correct 8 ms 8268 KB Output is correct
4 Correct 9 ms 8272 KB Output is correct
5 Correct 11 ms 8288 KB Output is correct
6 Correct 20 ms 8152 KB Output is correct
7 Correct 14 ms 8268 KB Output is correct
8 Correct 5 ms 8268 KB Output is correct
9 Correct 5 ms 8268 KB Output is correct
10 Correct 5 ms 8268 KB Output is correct
11 Correct 5 ms 8268 KB Output is correct
12 Correct 8 ms 8268 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 11 ms 8184 KB Output is correct
15 Correct 12 ms 8268 KB Output is correct
16 Execution timed out 1084 ms 54908 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 24132 KB Output is correct
2 Correct 104 ms 24168 KB Output is correct
3 Correct 100 ms 24156 KB Output is correct
4 Correct 105 ms 24228 KB Output is correct
5 Correct 104 ms 24164 KB Output is correct
6 Correct 108 ms 24116 KB Output is correct
7 Correct 107 ms 24092 KB Output is correct
8 Correct 100 ms 24140 KB Output is correct
9 Correct 100 ms 24168 KB Output is correct
10 Correct 108 ms 24188 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8140 KB Output is correct
2 Correct 3 ms 8140 KB Output is correct
3 Correct 3 ms 8140 KB Output is correct
4 Correct 3 ms 8140 KB Output is correct
5 Correct 3 ms 8140 KB Output is correct
6 Correct 3 ms 8140 KB Output is correct
7 Correct 3 ms 8140 KB Output is correct
8 Correct 4 ms 8140 KB Output is correct
9 Correct 3 ms 8140 KB Output is correct
10 Correct 3 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 3 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 6 ms 8268 KB Output is correct
16 Correct 11 ms 8268 KB Output is correct
17 Correct 8 ms 8268 KB Output is correct
18 Correct 9 ms 8272 KB Output is correct
19 Correct 11 ms 8288 KB Output is correct
20 Correct 20 ms 8152 KB Output is correct
21 Correct 14 ms 8268 KB Output is correct
22 Correct 5 ms 8268 KB Output is correct
23 Correct 5 ms 8268 KB Output is correct
24 Correct 5 ms 8268 KB Output is correct
25 Correct 5 ms 8268 KB Output is correct
26 Correct 8 ms 8268 KB Output is correct
27 Correct 10 ms 8268 KB Output is correct
28 Correct 11 ms 8184 KB Output is correct
29 Correct 12 ms 8268 KB Output is correct
30 Correct 28 ms 8124 KB Output is correct
31 Correct 17 ms 8192 KB Output is correct
32 Correct 12 ms 8184 KB Output is correct
33 Correct 11 ms 8140 KB Output is correct
34 Correct 14 ms 8140 KB Output is correct
35 Correct 22 ms 8188 KB Output is correct
36 Correct 9 ms 8140 KB Output is correct
37 Correct 14 ms 8140 KB Output is correct
38 Correct 30 ms 8088 KB Output is correct
39 Correct 18 ms 8184 KB Output is correct
40 Correct 9 ms 8140 KB Output is correct
41 Correct 23 ms 8192 KB Output is correct
42 Correct 21 ms 8188 KB Output is correct
43 Correct 10 ms 8268 KB Output is correct
44 Correct 18 ms 8188 KB Output is correct
45 Correct 19 ms 8188 KB Output is correct
46 Correct 23 ms 8192 KB Output is correct
47 Correct 31 ms 8140 KB Output is correct
48 Correct 13 ms 8140 KB Output is correct
49 Correct 11 ms 8192 KB Output is correct
50 Correct 7 ms 8140 KB Output is correct

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8140 KB Output is correct
2 Correct 3 ms 8140 KB Output is correct
3 Correct 3 ms 8140 KB Output is correct
4 Correct 3 ms 8140 KB Output is correct
5 Correct 3 ms 8140 KB Output is correct
6 Correct 3 ms 8140 KB Output is correct
7 Correct 3 ms 8140 KB Output is correct
8 Correct 4 ms 8140 KB Output is correct
9 Correct 3 ms 8140 KB Output is correct
10 Correct 3 ms 8140 KB Output is correct
11 Correct 4 ms 8140 KB Output is correct
12 Correct 3 ms 8140 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 6 ms 8268 KB Output is correct
16 Correct 11 ms 8268 KB Output is correct
17 Correct 8 ms 8268 KB Output is correct
18 Correct 9 ms 8272 KB Output is correct
19 Correct 11 ms 8288 KB Output is correct
20 Correct 20 ms 8152 KB Output is correct
21 Correct 14 ms 8268 KB Output is correct
22 Correct 5 ms 8268 KB Output is correct
23 Correct 5 ms 8268 KB Output is correct
24 Correct 5 ms 8268 KB Output is correct
25 Correct 5 ms 8268 KB Output is correct
26 Correct 8 ms 8268 KB Output is correct
27 Correct 10 ms 8268 KB Output is correct
28 Correct 11 ms 8184 KB Output is correct
29 Correct 12 ms 8268 KB Output is correct
30 Execution timed out 1084 ms 54908 KB Time limit exceeded
31 Halted 0 ms 0 KB -