Submission #1004206

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1004206	2024-06-21T06:26:59 Z	0pt1mus23	Horses (IOI15_horses)	C++14	17 / 100	20 ms	26196 KB

horses

/*
	understand error submission
*/
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
#define pii pair<int, int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl; return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7, sze = 5*1e5, prime = 23;
const int inf = INT_MAX;
int arr[sze],brr[sze];
int n;

const int dse = 1e3; 
int dp[dse+1][dse+1];

int func(){
	int ans=0;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=dse;j++){
			dp[i][j]=-1;
		}
	}
	dp[0][1]=0;
	for(int i=0;i<n;i++){
		for(int j=1;j<=dse;j++){
			if(dp[i][j]!=-1){
				int y =j * arr[i]; 
				// cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
				for(int k=0;k<=y;k++){
					if(k>dse){
						return 17;
					}
					dp[i+1][ y-k ] = (max( dp[i+1][y-k], (dp[i][j] + (k)* brr[i] ) %mod));
				}
			}

		}
	}
	for(int i=0;i<=n;i++){
		for(int j=0;j<=dse;j++){
			ans=max(ans,( dp[i][j] )%mod);
		}
	}
	return ans;
}

int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=0;i<n;i++){
		arr[i]=X[i];
		brr[i]=Y[i];
	}
	return func();
}

int updateX(int pos, int val) {	
	arr[pos]=val;
	return func();
}

int updateY(int pos, int val) {
	brr[pos]=val;
	return func();
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	8 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	8 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct

Subtask #2

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	504 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	0 ms	448 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Incorrect	2 ms	344 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	20 ms	26196 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	448 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	7 ms	508 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	7 ms	504 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	444 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	444 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-