oj.uz

Submission #425519

# Submission time Handle Problem Language Result Execution time Memory
425519 2021-06-13T06:22:17 Z Kevin_Zhang_TW Two Dishes (JOI19_dishes) C++17
10 / 100
 58 ms 32024 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 1000010, MAX_M = 2005;
const ll inf = 1ll << 59;

int n, m;

ll a[MAX_N], s[MAX_N], p[MAX_N], c[MAX_N];
ll b[MAX_N], t[MAX_N], q[MAX_N], d[MAX_N];

ll dp[MAX_M][MAX_M];

ll dp_diff[MAX_N];

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;

	assert(n < MAX_M && m < MAX_M);

	for (int i = 1;i <= n;++i) cin >> a[i] >> s[i] >> p[i];
	for (int i = 1;i <= m;++i) cin >> b[i] >> t[i] >> q[i];
	for (int i = 1;i <= n;++i) a[i] += a[i-1];
	for (int i = 1;i <= m;++i) b[i] += b[i-1];
	for (int i = 1;i <= n;++i) 
		c[i] = upper_bound(b, b + m + 1, s[i] - a[i]) - b - 1;
	for (int i = 1;i <= m;++i)
		d[i] = upper_bound(a, a + n + 1, t[i] - b[i]) - a - 1;
	
	dp_diff[0] = 0;
	for (int i = 1;i <= m;++i) dp_diff[0] += q[i];

	for (int i = 1;i <= m;++i) {
		dp_diff[i] = (0 > d[i] ? -q[i] : 0);
	}

	debug(dp_diff, dp_diff + m + 1);

	vector<int> id(m); iota(AI(id), 1);
	sort(AI(id), [&](int x, int y) {
		return d[x] < d[y];
	});

	for (int i = 0, j = 0;i < n;++i) {
		// first transfer i+1
		int v = c[i+1];

		dp_diff[0] += p[i+1];
		dp_diff[v+1] -= p[i+1];


		auto upd = [&](int j) {
			chmax(dp_diff[j], (i > d[j] ? -q[j] : 0));
		};

		for (int j = 1;j <= m;++j) upd(j);
	}

//	ll res = 0;
//	for (int i = 0;i <= m;++i) res += dp_diff[i];
//
//	cout << res << '\n';
//
	for (int i = 0;i <= n;++i) for (int j = 0;j <= m;++j)
		dp[i][j] = -inf;

	dp[0][0] = 0;
	for (int j = 1;j <= m;++j) dp[0][0] += q[j];

	for (int i = 0;i <= n;++i) {
		for (int j = 0;j <= m;++j) {
			// done
	  // equals to for j in [0, c[i+1]], dp[i][j] += p[i+1];
			//
	 
			//chmax(dp[i][j+1], dp[i][j] + (i > d[j+1] ? -q[j+1] : 0));
			if (j) chmax(dp[i][j], dp[i][j-1] + (i > d[j] ? -q[j] : 0));

			chmax(dp[i+1][j], dp[i][j] + (j <= c[i+1] ? p[i+1] : 0));
			DE(i, j, dp[i][j]);
		}
	}

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

}

Compilation message

dishes.cpp: In function 'int32_t main()':
dishes.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
dishes.cpp:52:2: note: in expansion of macro 'debug'
   52 |  debug(dp_diff, dp_diff + m + 1);
      |  ^~~~~
dishes.cpp:59:18: warning: unused variable 'j' [-Wunused-variable]
   59 |  for (int i = 0, j = 0;i < n;++i) {
      |                  ^
dishes.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
dishes.cpp:95:4: note: in expansion of macro 'DE'
   95 |    DE(i, j, dp[i][j]);
      |    ^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 444 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 57 ms 31984 KB Output is correct
18 Correct 37 ms 32024 KB Output is correct
19 Correct 58 ms 31984 KB Output is correct
20 Correct 53 ms 31976 KB Output is correct
21 Correct 53 ms 30844 KB Output is correct
22 Correct 55 ms 31912 KB Output is correct
23 Correct 57 ms 31940 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 57 ms 31984 KB Output is correct
18 Correct 37 ms 32024 KB Output is correct
19 Correct 58 ms 31984 KB Output is correct
20 Correct 53 ms 31976 KB Output is correct
21 Correct 53 ms 30844 KB Output is correct
22 Correct 55 ms 31912 KB Output is correct
23 Correct 57 ms 31940 KB Output is correct
24 Runtime error 6 ms 460 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 57 ms 31984 KB Output is correct
18 Correct 37 ms 32024 KB Output is correct
19 Correct 58 ms 31984 KB Output is correct
20 Correct 53 ms 31976 KB Output is correct
21 Correct 53 ms 30844 KB Output is correct
22 Correct 55 ms 31912 KB Output is correct
23 Correct 57 ms 31940 KB Output is correct
24 Runtime error 6 ms 460 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 57 ms 31984 KB Output is correct
18 Correct 37 ms 32024 KB Output is correct
19 Correct 58 ms 31984 KB Output is correct
20 Correct 53 ms 31976 KB Output is correct
21 Correct 53 ms 30844 KB Output is correct
22 Correct 55 ms 31912 KB Output is correct
23 Correct 57 ms 31940 KB Output is correct
24 Runtime error 6 ms 460 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -