oj.uz

Submission #47735

# Submission time Handle Problem Language Result Execution time Memory
47735 2018-05-07T02:30:23 Z RezwanArefin01 Horses (IOI15_horses) C++17
17 / 100
 24 ms 9444 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7; 
int n, x[11], y[11]; 

int dp[11][1010]; 

int call(int pos, int cur) {
	if(pos == n || !cur) return 0; 
	int &ret = dp[pos][cur];
	if(ret != -1) return ret; 
	ret = 0;
	int tot = cur * x[pos];
	for(int i = 0; i <= tot; i++) {
		ret = max(ret, call(pos + 1, tot - i) + i * y[pos]);
	} return ret; 
}
int init(int N, int X[], int Y[]) {
	n = N;
	for(int i = 0; i < N; i++) 
		x[i] = X[i], y[i] = Y[i];
	memset(dp, -1, sizeof dp); 
	return call(0, 1); 
}

int updateX(int pos, int val) {	
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

Compilation message

horses.cpp: In function 'int updateX(int, int)':
horses.cpp:28:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateX(int pos, int val) { 
                 ^~~
horses.cpp:28:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateX(int pos, int val) { 
                          ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:32:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateY(int pos, int val) {
                 ^~~
horses.cpp:32:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateY(int pos, int val) {
                          ^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 492 KB Output is correct
3 Correct 24 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 20 ms 492 KB Output is correct
8 Correct 21 ms 500 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 608 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 668 KB Output is correct
16 Correct 9 ms 668 KB Output is correct
17 Correct 2 ms 668 KB Output is correct
18 Correct 2 ms 668 KB Output is correct
19 Correct 2 ms 668 KB Output is correct
20 Correct 4 ms 668 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 668 KB Output is correct
2 Correct 4 ms 668 KB Output is correct
3 Correct 20 ms 756 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 756 KB Output is correct
6 Correct 2 ms 756 KB Output is correct
7 Correct 20 ms 796 KB Output is correct
8 Correct 20 ms 796 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 2 ms 816 KB Output is correct
11 Correct 2 ms 816 KB Output is correct
12 Correct 2 ms 816 KB Output is correct
13 Correct 2 ms 816 KB Output is correct
14 Correct 2 ms 816 KB Output is correct
15 Correct 2 ms 816 KB Output is correct
16 Correct 9 ms 816 KB Output is correct
17 Correct 2 ms 816 KB Output is correct
18 Correct 2 ms 816 KB Output is correct
19 Correct 2 ms 880 KB Output is correct
20 Correct 4 ms 880 KB Output is correct
21 Runtime error 2 ms 1056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 9444 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9444 KB Output is correct
2 Correct 4 ms 9444 KB Output is correct
3 Correct 20 ms 9444 KB Output is correct
4 Correct 2 ms 9444 KB Output is correct
5 Correct 2 ms 9444 KB Output is correct
6 Correct 2 ms 9444 KB Output is correct
7 Correct 20 ms 9444 KB Output is correct
8 Correct 20 ms 9444 KB Output is correct
9 Correct 2 ms 9444 KB Output is correct
10 Correct 2 ms 9444 KB Output is correct
11 Correct 2 ms 9444 KB Output is correct
12 Correct 2 ms 9444 KB Output is correct
13 Correct 2 ms 9444 KB Output is correct
14 Correct 2 ms 9444 KB Output is correct
15 Correct 2 ms 9444 KB Output is correct
16 Correct 9 ms 9444 KB Output is correct
17 Correct 2 ms 9444 KB Output is correct
18 Correct 2 ms 9444 KB Output is correct
19 Correct 2 ms 9444 KB Output is correct
20 Correct 4 ms 9444 KB Output is correct
21 Runtime error 3 ms 9444 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9444 KB Output is correct
2 Correct 4 ms 9444 KB Output is correct
3 Correct 20 ms 9444 KB Output is correct
4 Correct 2 ms 9444 KB Output is correct
5 Correct 2 ms 9444 KB Output is correct
6 Correct 2 ms 9444 KB Output is correct
7 Correct 20 ms 9444 KB Output is correct
8 Correct 20 ms 9444 KB Output is correct
9 Correct 2 ms 9444 KB Output is correct
10 Correct 2 ms 9444 KB Output is correct
11 Correct 2 ms 9444 KB Output is correct
12 Correct 2 ms 9444 KB Output is correct
13 Correct 2 ms 9444 KB Output is correct
14 Correct 2 ms 9444 KB Output is correct
15 Correct 2 ms 9444 KB Output is correct
16 Correct 9 ms 9444 KB Output is correct
17 Correct 2 ms 9444 KB Output is correct
18 Correct 2 ms 9444 KB Output is correct
19 Correct 2 ms 9444 KB Output is correct
20 Correct 4 ms 9444 KB Output is correct
21 Runtime error 2 ms 9444 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -