oj.uz

Submission #72402

# Submission time Handle Problem Language Result Execution time Memory
72402 2018-08-26T07:46:37 Z IDxTree(#2155, TAMREF, imeimi2000, Diuven) Gorgeous Pill (FXCUP3_gorgeous) C++14
51 / 100
 16 ms 16468 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

int n;
int c[1001];
int d[1001];
llong dp[1001][1001];

int cost(int i, int cnt) {
    if (c[i] != cnt) return 0;
    return d[i];
}

llong pro_dp(int s, int e) {
    if (dp[s][e] != -1) return dp[s][e];
    int cnt = e - s + 2;
    if (s > 1) dp[s][e] = max(dp[s][e], pro_dp(s - 1, e) + cost(s - 1, cnt));
    if (e < n) dp[s][e] = max(dp[s][e], pro_dp(s, e + 1) + cost(e + 1, cnt));
    return dp[s][e];
}


int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", c + i);
    for (int i = 1; i <= n; ++i) scanf("%d", d + i);
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) dp[i][j] = -1;
    dp[1][n] = 0;
    for (int i = 1; i <= n; ++i) printf("%lld ", pro_dp(i, i) + cost(i, 1));
	return 0;
}

Compilation message

gorgeous.cpp: In function 'int main()':
gorgeous.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
gorgeous.cpp:42:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; ++i) scanf("%d", c + i);
                                  ~~~~~^~~~~~~~~~~~~
gorgeous.cpp:43:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; ++i) scanf("%d", d + i);
                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 548 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 1076 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 6 ms 3052 KB Output is correct
11 Correct 11 ms 6764 KB Output is correct
12 Correct 13 ms 8060 KB Output is correct
13 Correct 15 ms 8460 KB Output is correct
14 Correct 14 ms 8460 KB Output is correct
15 Correct 14 ms 8460 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 1076 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 6 ms 3052 KB Output is correct
11 Correct 11 ms 6764 KB Output is correct
12 Correct 13 ms 8060 KB Output is correct
13 Correct 15 ms 8460 KB Output is correct
14 Correct 14 ms 8460 KB Output is correct
15 Correct 14 ms 8460 KB Output is correct
16 Runtime error 16 ms 16468 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -