답안 #833260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833260	2023-08-22T03:48:02 Z	kwongweng	Feast (NOI19_feast)	C++17	59 / 100	109 ms	262144 KB

feast

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second

const ll INF = 1e18;

void solve(){
  int n,k; cin>>n>>k;
  vi a(n+1); FOR(i,1,n+1) cin>>a[i];
  vector<ll> s(n+1); FOR(i,1,n+1) s[i]=s[i-1]+a[i];
  ll dp[n+1][k+1]; ms(dp,0,sizeof(dp));
  ll f[n+1][k+1]; ms(f,0,sizeof(f));
  FOR(i,1,n+1){
    f[i][0]=-s[i];
    f[i][0]=max(f[i][0],f[i-1][0]);
    FOR(j,1,k+1){
      dp[i][j]=max(dp[i][j],dp[i][j-1]);
      dp[i][j]=max(dp[i][j],dp[i-1][j]);
      dp[i][j]=max(dp[i][j],s[i]+f[i-1][j-1]);
      f[i][j]=dp[i][j]-s[i];
      if (i>1) f[i][j]=max(f[i][j],f[i-1][j]);
      //cout<<dp[i][j]<<" ";
      //cout<<f[i][j]<<" ";
    }
    //cout<<"\n";
  }
  cout<<dp[n][k]<<"\n";
}

int main(){
	//MOD=MOD1;
    ios::sync_with_stdio(false);
    if (fopen("input.txt", "r")) {
		  freopen("input.txt", "r", stdin);
    	freopen("output.txt", "w", stdout);
	  }
    int TC = 1;
    //cin >> TC; 
    FOR(i, 1, TC+1){
        //cout << "Case #" << i << ": ";
        solve();
    }
	
	return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:46:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |      freopen("output.txt", "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	109 ms	262144 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	12884 KB	Output is correct
2	Correct	22 ms	13140 KB	Output is correct
3	Correct	23 ms	12884 KB	Output is correct
4	Runtime error	99 ms	262144 KB	Execution killed with signal 9
5	Halted	0 ms	0 KB	-

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	13012 KB	Output is correct
2	Correct	31 ms	12884 KB	Output is correct
3	Correct	31 ms	13012 KB	Output is correct
4	Correct	31 ms	12884 KB	Output is correct
5	Correct	32 ms	13036 KB	Output is correct
6	Correct	32 ms	13012 KB	Output is correct
7	Correct	38 ms	13144 KB	Output is correct
8	Correct	40 ms	13004 KB	Output is correct
9	Correct	32 ms	13212 KB	Output is correct
10	Correct	32 ms	13140 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	5 ms	6356 KB	Output is correct
22	Correct	38 ms	51412 KB	Output is correct
23	Correct	9 ms	11988 KB	Output is correct
24	Correct	5 ms	6868 KB	Output is correct
25	Correct	7 ms	9428 KB	Output is correct
26	Correct	4 ms	5716 KB	Output is correct
27	Correct	6 ms	8916 KB	Output is correct
28	Correct	1 ms	1364 KB	Output is correct
29	Correct	1 ms	1236 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct

Subtask #7
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	109 ms	262144 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

답안 #833260

Compilation message

Subtask #1 0 / 4.0

Subtask #2 0 / 8.0

Subtask #3 18.0 / 18.0

Subtask #4 10.0 / 10.0

Subtask #5 11.0 / 11.0

Subtask #6 20.0 / 20.0

Subtask #7 0 / 29.0

Subtask #1
0 / 4.0

Subtask #2
0 / 8.0

Subtask #3
18.0 / 18.0

Subtask #4
10.0 / 10.0

Subtask #5
11.0 / 11.0

Subtask #6
20.0 / 20.0

Subtask #7
0 / 29.0