oj.uz

답안 #72528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72528 2018-08-26T08:49:28 Z IDxTree(#2155, TAMREF, imeimi2000, Diuven) 재채점 전쟁 (FXCUP3_judge) C++17
0 / 100
 2 ms 376 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

judge.cpp: In function 'int main()':
judge.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
judge.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);
                                  ~~~~~^~~~~~~~~~~~~
judge.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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -