Submission #203790

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
203790	2020-02-22T07:42:46 Z	dimash241	Two Dishes (JOI19_dishes)	C++17	10 / 100	1148 ms	168440 KB

dishes

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e6 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m;
struct css {
	ll s, t, p;
} a[N], b[N];

ll dp[2020][2020];

int main () {
   	SpeedForce;
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i].s >> a[i].t >> a[i].p;
		a[i].s += a[i-1].s;
	}
	for (int i = 1; i <= m; i ++) {
		cin >> b[i].s >> b[i].t >> b[i].p;
		b[i].s += b[i-1].s;
	}
	for (int i = 0; i <= n; i ++) {
		for (int j = 0; j <= m; j++)
			dp[i][j] = -INF * (i + j > 0);
	}

	for (int i = 0; i <= n; i ++) {
	//	cout << "for : " << i << '\n';
		for (int j = 0; j <= m; ++j) {
			if (i < n) {
				dp[i+1][j] = max(dp[i+1][j], dp[i][j] + (a[i+1].s + b[j].s <= a[i+1].t ? a[i+1].p : 0));
			}
			if (j < m) {
				dp[i][j+1] = max(dp[i][j+1], dp[i][j] + (a[i].s + b[j+1].s <= b[j+1].t ? b[j+1].p : 0));
			}
		//	cout << j << ' ' << dp[i][j] << '\n';
		}
	}

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

   	return Accepted;
}

// B...a

Subtask #1
0 / 5.0

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

Subtask #2
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	408 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	408 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	392 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	6 ms	428 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	412 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct

Subtask #3
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	408 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	408 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	392 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	6 ms	428 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	412 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	67 ms	32120 KB	Output is correct
18	Correct	52 ms	32148 KB	Output is correct
19	Correct	58 ms	32224 KB	Output is correct
20	Correct	59 ms	32204 KB	Output is correct
21	Correct	50 ms	30840 KB	Output is correct
22	Correct	56 ms	32120 KB	Output is correct
23	Correct	63 ms	32120 KB	Output is correct

Subtask #4
0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	408 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	408 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	392 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	6 ms	428 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	412 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	67 ms	32120 KB	Output is correct
18	Correct	52 ms	32148 KB	Output is correct
19	Correct	58 ms	32224 KB	Output is correct
20	Correct	59 ms	32204 KB	Output is correct
21	Correct	50 ms	30840 KB	Output is correct
22	Correct	56 ms	32120 KB	Output is correct
23	Correct	63 ms	32120 KB	Output is correct
24	Runtime error	1148 ms	168440 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
25	Halted	0 ms	0 KB	-

Subtask #5
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	408 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	408 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	392 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	6 ms	428 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	412 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	67 ms	32120 KB	Output is correct
18	Correct	52 ms	32148 KB	Output is correct
19	Correct	58 ms	32224 KB	Output is correct
20	Correct	59 ms	32204 KB	Output is correct
21	Correct	50 ms	30840 KB	Output is correct
22	Correct	56 ms	32120 KB	Output is correct
23	Correct	63 ms	32120 KB	Output is correct
24	Runtime error	1148 ms	168440 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	408 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	408 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	392 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	6 ms	428 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	412 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	67 ms	32120 KB	Output is correct
18	Correct	52 ms	32148 KB	Output is correct
19	Correct	58 ms	32224 KB	Output is correct
20	Correct	59 ms	32204 KB	Output is correct
21	Correct	50 ms	30840 KB	Output is correct
22	Correct	56 ms	32120 KB	Output is correct
23	Correct	63 ms	32120 KB	Output is correct
24	Runtime error	1148 ms	168440 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
25	Halted	0 ms	0 KB	-

Subtask #7
0 / 17.0

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

Subtask #8
0 / 9.0

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

Submission #203790

Compilation message