oj.uz

Submission #917243

# Submission time Handle Problem Language Result Execution time Memory
917243 2024-01-27T14:02:55 Z MateiKing80 Mean (info1cup19_mean) C++14
100 / 100
 3 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define int ll

int dp[205][205];
//dp[i][j] cel mai mare numar care se poate obtine dupa ce facem operatii pe numerele de la i la j
int v[205];

#define j i + lg

signed main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> dp[i][i];

    for(int lg = 1; lg < n; lg ++)
        for(int i = 1; i <= n - lg; i ++)
            for(int k = i; k < j; k ++)
                dp[i][j] = max(dp[i][j], (dp[i][k] + dp[k + 1][j]) / 2);
    cout << dp[1][n];
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct