oj.uz

답안 #96225

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96225 2019-02-07T09:38:31 Z Retro3014 놀이터에 떨어진 이상한 약 (FXCUP3_gorgeous) C++14
0 / 100
 2 ms 376 KB 
#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 1000
typedef long long ll;
int N;
ll dp[MAX_N+1][MAX_N+1];
vector<int> C, D;


int main(){
	scanf("%d", &N);
	for(int i=0; i<N; i++){
		int a;
		scanf("%d", &a); C.push_back(a);
	}
	for(int i=0; i<N; i++){
		int a; scanf("%d", &a); D.push_back(a);
	}
	for(int L=N; L>1; L--){
		for(int i=0; i+L-1<N; i++){
			int j = i+L-1;
			if(C[i]==L){
				dp[i+1][j] = max(dp[i+1][j], dp[i][j]+(ll)D[i]);
			}else{
				dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
			}
			if(C[j]==L){
				dp[i][j-1] = max(dp[i][j-1], dp[i][j]+(ll)D[j]);
			}else{
				dp[i][j-1] = max(dp[i][j-1], dp[i][j]);
			}
		}
	}
	for(int i=0; i<N; i++){
		if(C[i]==1){
			dp[i][i]+=(ll)D[i];
		}
		printf("%d ", dp[i][i]);
	}
	return 0;
}

Compilation message

gorgeous.cpp: In function 'int main()':
gorgeous.cpp:43:25: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
   printf("%d ", dp[i][i]);
                 ~~~~~~~~^
gorgeous.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
gorgeous.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a); C.push_back(a);
   ~~~~~^~~~~~~~~~
gorgeous.cpp:22:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a; scanf("%d", &a); D.push_back(a);
          ~~~~~^~~~~~~~~~

Subtask #1
0 / 12.0

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

Subtask #2
0 / 39.0

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

Subtask #3
0 / 49.0

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