oj.uz

Submission #682382

# Submission time Handle Problem Language Result Execution time Memory
682382 2023-01-16T07:38:36 Z vjudge1 Food Court (JOI21_foodcourt) C++17
7 / 100
 230 ms 341728 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimization("g", on)
#pragma GCC optimization("03")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define rbg rbegin()
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
#define emp empty()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 2.5e5 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
deque<pll> d[N];
ll t[N * 4], u[N * 4];

void push(ll v, ll tl, ll tr) {
	if (u[v]) {
		t[v] = max(t[v] + (tr - tl + 1) * u[v], 0ll);
		if (tl != tr) {
			u[v * 2] += u[v];
			u[v * 2 + 1] += u[v];
		}
	}
	u[v] = 0;
}

void upd(ll v, ll tl, ll tr, ll l, ll r, ll x) {
	push(v, tl, tr);
	if (r < tl || tr < l) return;
	if (l <= tl && tr <= r) {
		u[v] += x;
		push(v, tl, tr);
		return;
	}
	push(v, tl, tr);
	ll tm = (tl + tr) / 2;
	upd(v * 2, tl, tm, l, r, x);
	upd(v * 2 + 1, tm + 1, tr, l, r, x);
	t[v] = t[v * 2] + t[v * 2 + 1];
}

ll get(ll v, ll tl, ll tr, ll pos) {
	push(v, tl, tr);
	if (tl == tr) {
		return t[v];
	}
	ll tm = (tl + tr) / 2;
	if (pos <= tm) return get(v * 2, tl, tm, pos);
	else return get(v * 2 + 1, tm + 1, tr, pos);
}

void solve() {
	ll n, m, q; cin >> n >> m >> q;
//	if (m == 1) {
//		while (q--) {
//			ll tp; cin >> tp;
//			if (tp == 1) {
//				ll l, r, c, k; cin >> l >> r >> c >> k;
//				upd(1, 1, n, l, r, k);
//			} else if (tp == 2) {
//				ll l, r, k; cin >> l >> r >> k;
//				upd(1, 1, n, l, r, -k);
//			} else {
//				ll a, b; cin >> a >> b;
//				cout << (get(1, 1, n, a) >= b) << en;
//			}
//		}
//		return;
//	}
	if (n > 2000) assert(0);
	while (q--) {
		ll tp; cin >> tp;
		if (tp == 1) {
			ll l, r, c, k; cin >> l >> r >> c >> k;
			for (ll i = l;i <= r;i++) {
				ll tm = k;
				if (!d[i].emp) {
					pll p = d[i].back();
					if (p.ff == c) {
						tm += p.ss;
						d[i].pop_back();
					}
				} 
				d[i].pb({c, tm});
			}
		} else if (tp == 2) {
			ll l, r, k; cin >> l >> r >> k;
			for (ll i = l;i <= r;i++) {
				ll tm = k;
				while (tm) {
					if (d[i].emp) br;
					if (d[i].front().ss > tm) {
						ll x = d[i].front().ff, y = d[i].front().ss;
						d[i].pop_front();
						d[i].push_front({x, y - tm});
						tm = 0;
					} else {
						tm -= d[i].front().ss;
						d[i].pop_front();
					}
				}
			}
		} else {
			ll a, b; cin >> a >> b;
			ll tm = b;
			for (auto to : d[a]) {
				if (to.ss >= tm) {
					tm = 0;
					cout << to.ff << en;
					br;
				} else {
					tm -= to.ss;
				}
			}
			if (tm != 0) {
				cout << 0 << en;
			}
		}
	}
}

int main() {    
    aboba  
    //freopen("numbers");
    //cin >> tt;
    for (int i = 1;i <= tt;i++) {
        solve();
    }
}

Compilation message

foodcourt.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("g", on)
      | 
foodcourt.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization("03")
      | 
foodcourt.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
foodcourt.cpp: In function 'void freopen(std::string)':
foodcourt.cpp:49:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:49:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 169052 KB Output is correct
2 Correct 114 ms 169556 KB Output is correct
3 Correct 121 ms 176052 KB Output is correct
4 Correct 138 ms 179500 KB Output is correct
5 Correct 124 ms 168564 KB Output is correct
6 Correct 99 ms 168528 KB Output is correct
7 Correct 126 ms 181148 KB Output is correct
8 Correct 126 ms 176780 KB Output is correct
9 Correct 129 ms 169436 KB Output is correct
10 Correct 135 ms 176204 KB Output is correct
11 Correct 129 ms 173368 KB Output is correct
12 Correct 122 ms 169564 KB Output is correct
13 Correct 120 ms 169536 KB Output is correct
14 Correct 124 ms 170708 KB Output is correct
15 Correct 119 ms 171512 KB Output is correct
16 Correct 125 ms 170668 KB Output is correct
17 Correct 124 ms 169060 KB Output is correct
18 Correct 126 ms 169176 KB Output is correct
19 Correct 100 ms 168588 KB Output is correct
20 Correct 104 ms 168532 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 169052 KB Output is correct
2 Correct 114 ms 169556 KB Output is correct
3 Correct 121 ms 176052 KB Output is correct
4 Correct 138 ms 179500 KB Output is correct
5 Correct 124 ms 168564 KB Output is correct
6 Correct 99 ms 168528 KB Output is correct
7 Correct 126 ms 181148 KB Output is correct
8 Correct 126 ms 176780 KB Output is correct
9 Correct 129 ms 169436 KB Output is correct
10 Correct 135 ms 176204 KB Output is correct
11 Correct 129 ms 173368 KB Output is correct
12 Correct 122 ms 169564 KB Output is correct
13 Correct 120 ms 169536 KB Output is correct
14 Correct 124 ms 170708 KB Output is correct
15 Correct 119 ms 171512 KB Output is correct
16 Correct 125 ms 170668 KB Output is correct
17 Correct 124 ms 169060 KB Output is correct
18 Correct 126 ms 169176 KB Output is correct
19 Correct 100 ms 168588 KB Output is correct
20 Correct 104 ms 168532 KB Output is correct
21 Correct 128 ms 169260 KB Output is correct
22 Correct 118 ms 169524 KB Output is correct
23 Correct 124 ms 175984 KB Output is correct
24 Correct 149 ms 179716 KB Output is correct
25 Correct 107 ms 168616 KB Output is correct
26 Correct 101 ms 168596 KB Output is correct
27 Correct 134 ms 180572 KB Output is correct
28 Correct 139 ms 177444 KB Output is correct
29 Correct 127 ms 171116 KB Output is correct
30 Correct 131 ms 175940 KB Output is correct
31 Correct 126 ms 173260 KB Output is correct
32 Correct 126 ms 169492 KB Output is correct
33 Correct 117 ms 169468 KB Output is correct
34 Correct 140 ms 171720 KB Output is correct
35 Correct 125 ms 170140 KB Output is correct
36 Correct 143 ms 170600 KB Output is correct
37 Correct 101 ms 168568 KB Output is correct
38 Correct 108 ms 168564 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 169052 KB Output is correct
2 Correct 114 ms 169556 KB Output is correct
3 Correct 121 ms 176052 KB Output is correct
4 Correct 138 ms 179500 KB Output is correct
5 Correct 124 ms 168564 KB Output is correct
6 Correct 99 ms 168528 KB Output is correct
7 Correct 126 ms 181148 KB Output is correct
8 Correct 126 ms 176780 KB Output is correct
9 Correct 129 ms 169436 KB Output is correct
10 Correct 135 ms 176204 KB Output is correct
11 Correct 129 ms 173368 KB Output is correct
12 Correct 122 ms 169564 KB Output is correct
13 Correct 120 ms 169536 KB Output is correct
14 Correct 124 ms 170708 KB Output is correct
15 Correct 119 ms 171512 KB Output is correct
16 Correct 125 ms 170668 KB Output is correct
17 Correct 124 ms 169060 KB Output is correct
18 Correct 126 ms 169176 KB Output is correct
19 Correct 100 ms 168588 KB Output is correct
20 Correct 104 ms 168532 KB Output is correct
21 Runtime error 221 ms 341644 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 169052 KB Output is correct
2 Correct 114 ms 169556 KB Output is correct
3 Correct 121 ms 176052 KB Output is correct
4 Correct 138 ms 179500 KB Output is correct
5 Correct 124 ms 168564 KB Output is correct
6 Correct 99 ms 168528 KB Output is correct
7 Correct 126 ms 181148 KB Output is correct
8 Correct 126 ms 176780 KB Output is correct
9 Correct 129 ms 169436 KB Output is correct
10 Correct 135 ms 176204 KB Output is correct
11 Correct 129 ms 173368 KB Output is correct
12 Correct 122 ms 169564 KB Output is correct
13 Correct 120 ms 169536 KB Output is correct
14 Correct 124 ms 170708 KB Output is correct
15 Correct 119 ms 171512 KB Output is correct
16 Correct 125 ms 170668 KB Output is correct
17 Correct 124 ms 169060 KB Output is correct
18 Correct 126 ms 169176 KB Output is correct
19 Correct 100 ms 168588 KB Output is correct
20 Correct 104 ms 168532 KB Output is correct
21 Correct 128 ms 169260 KB Output is correct
22 Correct 118 ms 169524 KB Output is correct
23 Correct 124 ms 175984 KB Output is correct
24 Correct 149 ms 179716 KB Output is correct
25 Correct 107 ms 168616 KB Output is correct
26 Correct 101 ms 168596 KB Output is correct
27 Correct 134 ms 180572 KB Output is correct
28 Correct 139 ms 177444 KB Output is correct
29 Correct 127 ms 171116 KB Output is correct
30 Correct 131 ms 175940 KB Output is correct
31 Correct 126 ms 173260 KB Output is correct
32 Correct 126 ms 169492 KB Output is correct
33 Correct 117 ms 169468 KB Output is correct
34 Correct 140 ms 171720 KB Output is correct
35 Correct 125 ms 170140 KB Output is correct
36 Correct 143 ms 170600 KB Output is correct
37 Correct 101 ms 168568 KB Output is correct
38 Correct 108 ms 168564 KB Output is correct
39 Runtime error 221 ms 341644 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 169052 KB Output is correct
2 Correct 114 ms 169556 KB Output is correct
3 Correct 121 ms 176052 KB Output is correct
4 Correct 138 ms 179500 KB Output is correct
5 Correct 124 ms 168564 KB Output is correct
6 Correct 99 ms 168528 KB Output is correct
7 Correct 126 ms 181148 KB Output is correct
8 Correct 126 ms 176780 KB Output is correct
9 Correct 129 ms 169436 KB Output is correct
10 Correct 135 ms 176204 KB Output is correct
11 Correct 129 ms 173368 KB Output is correct
12 Correct 122 ms 169564 KB Output is correct
13 Correct 120 ms 169536 KB Output is correct
14 Correct 124 ms 170708 KB Output is correct
15 Correct 119 ms 171512 KB Output is correct
16 Correct 125 ms 170668 KB Output is correct
17 Correct 124 ms 169060 KB Output is correct
18 Correct 126 ms 169176 KB Output is correct
19 Correct 100 ms 168588 KB Output is correct
20 Correct 104 ms 168532 KB Output is correct
21 Correct 128 ms 169260 KB Output is correct
22 Correct 118 ms 169524 KB Output is correct
23 Correct 124 ms 175984 KB Output is correct
24 Correct 149 ms 179716 KB Output is correct
25 Correct 107 ms 168616 KB Output is correct
26 Correct 101 ms 168596 KB Output is correct
27 Correct 134 ms 180572 KB Output is correct
28 Correct 139 ms 177444 KB Output is correct
29 Correct 127 ms 171116 KB Output is correct
30 Correct 131 ms 175940 KB Output is correct
31 Correct 126 ms 173260 KB Output is correct
32 Correct 126 ms 169492 KB Output is correct
33 Correct 117 ms 169468 KB Output is correct
34 Correct 140 ms 171720 KB Output is correct
35 Correct 125 ms 170140 KB Output is correct
36 Correct 143 ms 170600 KB Output is correct
37 Correct 101 ms 168568 KB Output is correct
38 Correct 108 ms 168564 KB Output is correct
39 Runtime error 221 ms 341644 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -