oj.uz

답안 #532056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532056 2022-03-02T04:35:13 Z 8e7 Two Dishes (JOI19_dishes) C++17
10 / 100
 34 ms 16184 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 2005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct obj{
	ll t, lim;
	int val;
	obj(){t = lim = val = 0;}
} a[maxn], b[maxn];
const ll inf = 1LL<<60;
int dp[maxn][maxn];
int main() {
	io
	int n, m;
	cin >> n >> m;
	for (int i = 1;i <= n;i++) {
		cin >> a[i].t >> a[i].lim >> a[i].val;	
		if (i) a[i].t += a[i-1].t;
	}
	for (int i = 1;i <= m;i++) {
		cin >> b[i].t >> b[i].lim >> b[i].val;
		if (i) b[i].t += b[i-1].t;
	}
	for (int i = 0;i <= n;i++) {
		for (int j = 0;j <= m;j++) {
			if (i) dp[i][j] = max(dp[i][j], dp[i-1][j] + (a[i].t + b[j].t <= a[i].lim ? a[i].val : 0));
			if (j) dp[i][j] = max(dp[i][j], dp[i][j-1] + (a[i].t + b[j].t <= b[j].lim ? b[j].val : 0));
		}
	}
	cout << dp[n][m] << "\n";	
}

Subtask #1
0 / 5.0

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

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 34 ms 16116 KB Output is correct
18 Correct 27 ms 16184 KB Output is correct
19 Correct 29 ms 16068 KB Output is correct
20 Correct 27 ms 16116 KB Output is correct
21 Correct 28 ms 15556 KB Output is correct
22 Correct 30 ms 16100 KB Output is correct
23 Correct 30 ms 16076 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 34 ms 16116 KB Output is correct
18 Correct 27 ms 16184 KB Output is correct
19 Correct 29 ms 16068 KB Output is correct
20 Correct 27 ms 16116 KB Output is correct
21 Correct 28 ms 15556 KB Output is correct
22 Correct 30 ms 16100 KB Output is correct
23 Correct 30 ms 16076 KB Output is correct
24 Runtime error 2 ms 812 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 34 ms 16116 KB Output is correct
18 Correct 27 ms 16184 KB Output is correct
19 Correct 29 ms 16068 KB Output is correct
20 Correct 27 ms 16116 KB Output is correct
21 Correct 28 ms 15556 KB Output is correct
22 Correct 30 ms 16100 KB Output is correct
23 Correct 30 ms 16076 KB Output is correct
24 Runtime error 2 ms 812 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 34 ms 16116 KB Output is correct
18 Correct 27 ms 16184 KB Output is correct
19 Correct 29 ms 16068 KB Output is correct
20 Correct 27 ms 16116 KB Output is correct
21 Correct 28 ms 15556 KB Output is correct
22 Correct 30 ms 16100 KB Output is correct
23 Correct 30 ms 16076 KB Output is correct
24 Runtime error 2 ms 812 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

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

Subtask #8
0 / 9.0

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