oj.uz

Submission #747496

# Submission time Handle Problem Language Result Execution time Memory
747496 2023-05-24T08:29:12 Z Toxtaq Discharging (NOI20_discharging) C++17
0 / 100
 1000 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v;
vector<vector<int>>max_table;
long long rec(int indx){
    long long res = 1e18;
    if(indx == n + 1)return 0;
    for(int i = indx;i <= n;++i){
        res = min(res, (n - indx + 1) * max_table[indx][i] + rec(i + 1));
    }
    return res;
}
int main()
{
    cin >> n;
    v.resize(n + 1);
    max_table.assign(n + 1, vector<int>(n + 1));
    for(int i = 1;i <= n;++i)cin >> v[i];
    for(int i = 1;i <= n;++i){
        int mx = -1e9;
        for(int j = i;j <= n;++j){
            mx = max(mx, v[j]);
            max_table[i][j] = mx;
        }
    }
    cout << rec(1);
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 9044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 9044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 403 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 296 KB Output isn't correct
4 Halted 0 ms 0 KB -