oj.uz

Submission #747487

# Submission time Handle Problem Language Result Execution time Memory
747487 2023-05-24T08:20:45 Z Toxtaq Discharging (NOI20_discharging) C++17
9 / 100
 1000 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v;
vector<vector<int>>max_table;
map<pair<int, vector<int>>, long long>table;
long long rec(int indx, vector<int>mx, long long pref){
    long long res = 1e18;
    if(indx == n + 1)return 0;
    if(table.count({indx, mx}))return table[{indx, mx}];
    for(int i = indx;i <= n;++i){
        mx.push_back(max_table[indx][i]);
        pref += max_table[indx][i];
        res = min(res, (i - indx + 1) * pref + rec(i + 1, mx, pref));
        pref -= max_table[indx][i];
        mx.pop_back();
    }
    return table[{indx, mx}] = 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;
        }
    }
    vector<int>tempo;
    cout << rec(1, tempo, 0);
}

Subtask #1
9.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 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 203524 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 1086 ms 203524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 396 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 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Execution timed out 1086 ms 203524 KB Time limit exceeded
16 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 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Execution timed out 1086 ms 203524 KB Time limit exceeded
16 Halted 0 ms 0 KB -