oj.uz

답안 #528780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528780 2022-02-21T12:38:49 Z fhvirus Two Dishes (JOI19_dishes) C++17
10 / 100
 156 ms 26720 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#define debug(...) ((void)0)
#endif

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int N, M; cin >> N >> M;
	vector<int> A(N + 1), P(N + 1);
	vector<int64_t> S(N + 1);
	for (int i = 1; i <= N; ++i)
		cin >> A[i] >> S[i] >> P[i];
	vector<int> B(M + 1), Q(M + 1);
	vector<int64_t> T(M + 1);
	for (int i = 1; i <= M; ++i)
		cin >> B[i] >> T[i] >> Q[i];

	assert(N <= 5000 and M <= 5000);

	vector<int64_t> preA(N + 1, 0);
	for (int i = 1; i <= N; ++i)
		preA[i] = preA[i - 1] + A[i];

	vector<int64_t> preB(M + 1, 0);
	for (int i = 1; i <= M; ++i)
		preB[i] = preB[i - 1] + B[i];

	vector<int64_t> dp(M + 1, LLONG_MIN);
	dp[0] = 0;
	for (int i = 0; i <= N; ++i) {
		for (int j = 0; j <= M; ++j)
			dp[j] += (preA[i] + preB[j] <= S[i] ? P[i] : 0);
		for (int j = 1; j <= M; ++j)
			dp[j] = max(dp[j], dp[j - 1] + (preA[i] + preB[j] <= T[j] ? Q[j] : 0));
	}

	cout << dp[M] << '\n';

	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 19 ms 444 KB Output is correct
18 Correct 18 ms 524 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 21 ms 456 KB Output is correct
22 Correct 19 ms 332 KB Output is correct
23 Correct 20 ms 452 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 19 ms 444 KB Output is correct
18 Correct 18 ms 524 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 21 ms 456 KB Output is correct
22 Correct 19 ms 332 KB Output is correct
23 Correct 20 ms 452 KB Output is correct
24 Runtime error 121 ms 23716 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 19 ms 444 KB Output is correct
18 Correct 18 ms 524 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 21 ms 456 KB Output is correct
22 Correct 19 ms 332 KB Output is correct
23 Correct 20 ms 452 KB Output is correct
24 Runtime error 121 ms 23716 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 19 ms 444 KB Output is correct
18 Correct 18 ms 524 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 17 ms 444 KB Output is correct
21 Correct 21 ms 456 KB Output is correct
22 Correct 19 ms 332 KB Output is correct
23 Correct 20 ms 452 KB Output is correct
24 Runtime error 121 ms 23716 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

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

Subtask #8
0 / 9.0

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