Submission #72298

#	Time	Username	Problem	Language	Result	Execution time	Memory
72298		이시대의진정한망겜스타투 (#118)	Gorgeous Pill (FXCUP3_gorgeous)	C++14	51 / 100	12 ms	7580 KiB

gorgeous

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ldouble;

int N, C[1010], D[1010];
ll dp[1010][1010];

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=N-1;i>=0;i--) {
		for(int j=1;j+i<=N;j++) {
			int lv = j, rv = j + i;
			dp[lv][rv] = 0;
			if(lv != 1) dp[lv][rv] = max(dp[lv][rv], dp[lv - 1][rv] + (C[lv-1] == rv - lv + 2 ? D[lv-1] : 0));
			if(rv != N) dp[lv][rv] = max(dp[lv][rv], dp[lv][rv + 1] + (C[rv+1] == rv - lv + 2 ? D[rv+1] : 0));
		}
	}
	for(int i=1;i<=N;i++) if(C[i] == 1) dp[i][i] += D[i];
	for(int i=1;i<=N;i++) printf("%lld ", dp[i][i]); puts("");
	return 0;
}

Compilation message (stderr)

gorgeous.cpp: In function 'int main()':
gorgeous.cpp:48:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for(int i=1;i<=N;i++) printf("%lld ", dp[i][i]); puts("");
  ^~~
gorgeous.cpp:48:51: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for(int i=1;i<=N;i++) printf("%lld ", dp[i][i]); puts("");
                                                   ^~~~
gorgeous.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
gorgeous.cpp:37:29: 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:38:29: 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 / 12
• Subtask 2: 39 / 39
• Subtask 3: 0 / 49