oj.uz

Submission #532804

# Submission time Handle Problem Language Result Execution time Memory
532804 2022-03-04T00:58:09 Z 8e7 Two Dishes (JOI19_dishes) C++17
0 / 100
 290 ms 97228 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 1000005
#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, val;
	obj(){t = lim = val = 0;}
	obj(ll x){t = x, lim = 0, val = 0;}
} a[maxn], b[maxn];
vector<int> upd[maxn];

const ll inf = 1LL<<60;

int main() {
	io
	int n, m;
	cin >> n >> m;
	for (int i = 0;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 = 0;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++) {
		if (a[i].t > a[i].lim) {
			a[i].val = 0;
		} else {
			int ind = upper_bound(b, b + m, obj(a[i].lim - a[i].t), [&] (obj x, obj y){return x.t < y.t;}) - b;
			upd[ind].push_back(i);
		}
	}
	map<int, ll> mp; //difference array of g
	vector<int> neg;
	auto pref = [&] () {
		vector<int> val;
		for (int p:neg) {
			if (mp[p] >= 0) continue;
			auto it = mp.upper_bound(p);	
			ll x = -mp[p];
			mp[p] = 0;
			val.push_back(p);
			while (it != mp.end()) {
				if (it->ss > x) {
					it->ss -= x;
					break;
				} else {
					x -= it->ss;
					it->ss = 0;
					val.push_back(it->ff);
				}
				it = next(it);	
			}
		}
		for (auto i:val) mp.erase(mp.find(i));
		neg.clear();
	};
	auto ch = [&] (int p, ll x) {
		mp[p] += x;
		if (mp[p] < 0 && p) {
			neg.push_back(p);
		}
	};
	for (int i = 0;i < m;i++) {
		if (b[i].t <= b[i].lim) {
			int ind = upper_bound(a, a + n, obj(b[i].lim - b[i].t), [&] (obj x, obj y){return x.t < y.t;}) - a;
			ch(0, b[i].val);
			ch(ind, -b[i].val);
		}
		for (int j:upd[i]) {
			ch(j, a[j].val);
			a[j].val = 0;
		}
		sort(neg.begin(), neg.end(), [&] (int x, int y){return x > y;});
		pref();
		debug(i);
		for (auto j:mp) debug(j.ff, j.ss);
	}
	ll ans = 0;
	for (int i = 0;i < n;i++) ans += a[i].val;
	for (auto i:mp) {
		if (i.ff < n) ans += i.ss;
	}
	cout << ans << endl;
}
/*
3 4
1 3 -6
2 6 7
4 3 -3

2 1 5
3 10 1
3 8 -3
5 25 2
*/

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
dishes.cpp:93:3: note: in expansion of macro 'debug'
   93 |   debug(i);
      |   ^~~~~
dishes.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
dishes.cpp:94:19: note: in expansion of macro 'debug'
   94 |   for (auto j:mp) debug(j.ff, j.ss);
      |                   ^~~~~
dishes.cpp:94:13: warning: variable 'j' set but not used [-Wunused-but-set-variable]
   94 |   for (auto j:mp) debug(j.ff, j.ss);
      |             ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 88040 KB Output is correct
2 Correct 290 ms 97228 KB Output is correct
3 Correct 204 ms 85188 KB Output is correct
4 Incorrect 242 ms 88136 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 70700 KB Output is correct
2 Correct 31 ms 70724 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 31 ms 70732 KB Output is correct
5 Incorrect 32 ms 70668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 70700 KB Output is correct
2 Correct 31 ms 70724 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 31 ms 70732 KB Output is correct
5 Incorrect 32 ms 70668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 70700 KB Output is correct
2 Correct 31 ms 70724 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 31 ms 70732 KB Output is correct
5 Incorrect 32 ms 70668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 70700 KB Output is correct
2 Correct 31 ms 70724 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 31 ms 70732 KB Output is correct
5 Incorrect 32 ms 70668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 70700 KB Output is correct
2 Correct 31 ms 70724 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 31 ms 70732 KB Output is correct
5 Incorrect 32 ms 70668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 88040 KB Output is correct
2 Correct 290 ms 97228 KB Output is correct
3 Correct 204 ms 85188 KB Output is correct
4 Incorrect 242 ms 88136 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 88040 KB Output is correct
2 Correct 290 ms 97228 KB Output is correct
3 Correct 204 ms 85188 KB Output is correct
4 Incorrect 242 ms 88136 KB Output isn't correct
5 Halted 0 ms 0 KB -