oj.uz

Submission #572176

# Submission time Handle Problem Language Result Execution time Memory
572176 2022-06-03T22:36:12 Z sidon Two Dishes (JOI19_dishes) C++17
5 / 100
 297 ms 64508 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
int32_t main() {
	ios::sync_with_stdio(0), cin.tie(0);
 
	int N, M; cin >> N >> M;
 
	int A[N], S[N], P[N];
	int B[M], T[M], Q[M];
 
	for(int i = 0; i < N; ++i) {
		cin >> A[i] >> S[i] >> P[i];
		if(i) A[i] += A[i-1];
	}
 
	for(int i = 0; i < M; ++i) {
		cin >> B[i] >> T[i] >> Q[i];
		if(i) B[i] += B[i-1];
	}
 
	map<int, int> g[N+1] {{{0, 0}}};
	int ans {};
 
	for(int i = 0; i < N; ++i) if(S[i] >= A[i]) {
		S[i] = upper_bound(B, B + M, S[i] - A[i]) - B;
		g[i+1][S[i]] += P[i];
	}
	for(int i = 0; i < M; ++i) if(T[i] >= B[i]) {
		T[i] = upper_bound(A, A + N, T[i] - B[i]) - A;
		if(T[i] < N) g[T[i]+1][i] -= Q[i];
		ans += Q[i];
	}
 
	map<int, int> s;
 
	for(int i = 1; i <= N; ++i) {
		g[i][M] += 0;
 
		int cur {}, l {};
 
		auto fix = [&](int j) {
			auto f = s.upper_bound(j);
			while(f != s.end() && f->first <= M && f->second <= 0) {
				auto nx = next(f) == end(s) ? M + 1 : next(f)->first;
				s[nx] += f->second;
				f = s.erase(f);
			}
		};
 
		for(auto [r, val] : g[i]) cur += val;
		for(auto [r, val] : g[i]) {
			s[l] += cur;
			s[r+1] -= cur;
			cur -= val;
			l = r + 1;
		}
		for(auto [r, val] : g[i]) fix(r-1);
	}
 
	for(int i = 0; i <= M; ++i)
		ans += s[i];
	cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 59068 KB Output is correct
2 Correct 289 ms 63268 KB Output is correct
3 Correct 230 ms 49868 KB Output is correct
4 Correct 266 ms 56636 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 271 ms 64508 KB Output is correct
7 Correct 111 ms 24316 KB Output is correct
8 Correct 104 ms 33900 KB Output is correct
9 Correct 245 ms 54400 KB Output is correct
10 Correct 220 ms 63948 KB Output is correct
11 Correct 177 ms 51912 KB Output is correct

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 59068 KB Output is correct
2 Correct 289 ms 63268 KB Output is correct
3 Correct 230 ms 49868 KB Output is correct
4 Correct 266 ms 56636 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 271 ms 64508 KB Output is correct
7 Correct 111 ms 24316 KB Output is correct
8 Correct 104 ms 33900 KB Output is correct
9 Correct 245 ms 54400 KB Output is correct
10 Correct 220 ms 63948 KB Output is correct
11 Correct 177 ms 51912 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 320 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 59068 KB Output is correct
2 Correct 289 ms 63268 KB Output is correct
3 Correct 230 ms 49868 KB Output is correct
4 Correct 266 ms 56636 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 271 ms 64508 KB Output is correct
7 Correct 111 ms 24316 KB Output is correct
8 Correct 104 ms 33900 KB Output is correct
9 Correct 245 ms 54400 KB Output is correct
10 Correct 220 ms 63948 KB Output is correct
11 Correct 177 ms 51912 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 320 KB Output isn't correct
16 Halted 0 ms 0 KB -