oj.uz

Submission #682248

# Submission time Handle Problem Language Result Execution time Memory
682248 2023-01-16T05:13:02 Z vjudge1 Food Court (JOI21_foodcourt) C++17
7 / 100
 1000 ms 524288 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 = 6.5e4 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
deque<pll> d[N];

void solve() {
	ll n, m, q; cin >> n >> m >> q;
	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 44 ms 44472 KB Output is correct
2 Correct 41 ms 44900 KB Output is correct
3 Correct 48 ms 51520 KB Output is correct
4 Correct 59 ms 55056 KB Output is correct
5 Correct 38 ms 43988 KB Output is correct
6 Correct 34 ms 43956 KB Output is correct
7 Correct 66 ms 56764 KB Output is correct
8 Correct 64 ms 52232 KB Output is correct
9 Correct 48 ms 44884 KB Output is correct
10 Correct 53 ms 51564 KB Output is correct
11 Correct 53 ms 48796 KB Output is correct
12 Correct 41 ms 44976 KB Output is correct
13 Correct 41 ms 44996 KB Output is correct
14 Correct 45 ms 46120 KB Output is correct
15 Correct 39 ms 47044 KB Output is correct
16 Correct 42 ms 46116 KB Output is correct
17 Correct 33 ms 44372 KB Output is correct
18 Correct 37 ms 44580 KB Output is correct
19 Correct 28 ms 44024 KB Output is correct
20 Correct 28 ms 44028 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 44472 KB Output is correct
2 Correct 41 ms 44900 KB Output is correct
3 Correct 48 ms 51520 KB Output is correct
4 Correct 59 ms 55056 KB Output is correct
5 Correct 38 ms 43988 KB Output is correct
6 Correct 34 ms 43956 KB Output is correct
7 Correct 66 ms 56764 KB Output is correct
8 Correct 64 ms 52232 KB Output is correct
9 Correct 48 ms 44884 KB Output is correct
10 Correct 53 ms 51564 KB Output is correct
11 Correct 53 ms 48796 KB Output is correct
12 Correct 41 ms 44976 KB Output is correct
13 Correct 41 ms 44996 KB Output is correct
14 Correct 45 ms 46120 KB Output is correct
15 Correct 39 ms 47044 KB Output is correct
16 Correct 42 ms 46116 KB Output is correct
17 Correct 33 ms 44372 KB Output is correct
18 Correct 37 ms 44580 KB Output is correct
19 Correct 28 ms 44024 KB Output is correct
20 Correct 28 ms 44028 KB Output is correct
21 Correct 38 ms 44756 KB Output is correct
22 Correct 43 ms 45020 KB Output is correct
23 Correct 42 ms 51404 KB Output is correct
24 Correct 49 ms 55120 KB Output is correct
25 Correct 29 ms 43996 KB Output is correct
26 Correct 28 ms 44100 KB Output is correct
27 Correct 52 ms 56012 KB Output is correct
28 Correct 60 ms 52904 KB Output is correct
29 Correct 47 ms 46668 KB Output is correct
30 Correct 51 ms 51276 KB Output is correct
31 Correct 47 ms 48644 KB Output is correct
32 Correct 48 ms 44872 KB Output is correct
33 Correct 51 ms 44928 KB Output is correct
34 Correct 59 ms 47180 KB Output is correct
35 Correct 42 ms 45644 KB Output is correct
36 Correct 50 ms 46036 KB Output is correct
37 Correct 29 ms 44036 KB Output is correct
38 Correct 29 ms 44120 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 847 ms 44340 KB Output is correct
2 Correct 676 ms 44108 KB Output is correct
3 Correct 817 ms 44196 KB Output is correct
4 Correct 854 ms 44104 KB Output is correct
5 Correct 668 ms 44216 KB Output is correct
6 Correct 640 ms 44092 KB Output is correct
7 Correct 41 ms 44120 KB Output is correct
8 Correct 47 ms 44136 KB Output is correct
9 Execution timed out 1089 ms 44204 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 59 ms 89068 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 44472 KB Output is correct
2 Correct 41 ms 44900 KB Output is correct
3 Correct 48 ms 51520 KB Output is correct
4 Correct 59 ms 55056 KB Output is correct
5 Correct 38 ms 43988 KB Output is correct
6 Correct 34 ms 43956 KB Output is correct
7 Correct 66 ms 56764 KB Output is correct
8 Correct 64 ms 52232 KB Output is correct
9 Correct 48 ms 44884 KB Output is correct
10 Correct 53 ms 51564 KB Output is correct
11 Correct 53 ms 48796 KB Output is correct
12 Correct 41 ms 44976 KB Output is correct
13 Correct 41 ms 44996 KB Output is correct
14 Correct 45 ms 46120 KB Output is correct
15 Correct 39 ms 47044 KB Output is correct
16 Correct 42 ms 46116 KB Output is correct
17 Correct 33 ms 44372 KB Output is correct
18 Correct 37 ms 44580 KB Output is correct
19 Correct 28 ms 44024 KB Output is correct
20 Correct 28 ms 44028 KB Output is correct
21 Correct 847 ms 44340 KB Output is correct
22 Correct 676 ms 44108 KB Output is correct
23 Correct 817 ms 44196 KB Output is correct
24 Correct 854 ms 44104 KB Output is correct
25 Correct 668 ms 44216 KB Output is correct
26 Correct 640 ms 44092 KB Output is correct
27 Correct 41 ms 44120 KB Output is correct
28 Correct 47 ms 44136 KB Output is correct
29 Execution timed out 1089 ms 44204 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 638 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 44472 KB Output is correct
2 Correct 41 ms 44900 KB Output is correct
3 Correct 48 ms 51520 KB Output is correct
4 Correct 59 ms 55056 KB Output is correct
5 Correct 38 ms 43988 KB Output is correct
6 Correct 34 ms 43956 KB Output is correct
7 Correct 66 ms 56764 KB Output is correct
8 Correct 64 ms 52232 KB Output is correct
9 Correct 48 ms 44884 KB Output is correct
10 Correct 53 ms 51564 KB Output is correct
11 Correct 53 ms 48796 KB Output is correct
12 Correct 41 ms 44976 KB Output is correct
13 Correct 41 ms 44996 KB Output is correct
14 Correct 45 ms 46120 KB Output is correct
15 Correct 39 ms 47044 KB Output is correct
16 Correct 42 ms 46116 KB Output is correct
17 Correct 33 ms 44372 KB Output is correct
18 Correct 37 ms 44580 KB Output is correct
19 Correct 28 ms 44024 KB Output is correct
20 Correct 28 ms 44028 KB Output is correct
21 Correct 38 ms 44756 KB Output is correct
22 Correct 43 ms 45020 KB Output is correct
23 Correct 42 ms 51404 KB Output is correct
24 Correct 49 ms 55120 KB Output is correct
25 Correct 29 ms 43996 KB Output is correct
26 Correct 28 ms 44100 KB Output is correct
27 Correct 52 ms 56012 KB Output is correct
28 Correct 60 ms 52904 KB Output is correct
29 Correct 47 ms 46668 KB Output is correct
30 Correct 51 ms 51276 KB Output is correct
31 Correct 47 ms 48644 KB Output is correct
32 Correct 48 ms 44872 KB Output is correct
33 Correct 51 ms 44928 KB Output is correct
34 Correct 59 ms 47180 KB Output is correct
35 Correct 42 ms 45644 KB Output is correct
36 Correct 50 ms 46036 KB Output is correct
37 Correct 29 ms 44036 KB Output is correct
38 Correct 29 ms 44120 KB Output is correct
39 Correct 847 ms 44340 KB Output is correct
40 Correct 676 ms 44108 KB Output is correct
41 Correct 817 ms 44196 KB Output is correct
42 Correct 854 ms 44104 KB Output is correct
43 Correct 668 ms 44216 KB Output is correct
44 Correct 640 ms 44092 KB Output is correct
45 Correct 41 ms 44120 KB Output is correct
46 Correct 47 ms 44136 KB Output is correct
47 Execution timed out 1089 ms 44204 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 44472 KB Output is correct
2 Correct 41 ms 44900 KB Output is correct
3 Correct 48 ms 51520 KB Output is correct
4 Correct 59 ms 55056 KB Output is correct
5 Correct 38 ms 43988 KB Output is correct
6 Correct 34 ms 43956 KB Output is correct
7 Correct 66 ms 56764 KB Output is correct
8 Correct 64 ms 52232 KB Output is correct
9 Correct 48 ms 44884 KB Output is correct
10 Correct 53 ms 51564 KB Output is correct
11 Correct 53 ms 48796 KB Output is correct
12 Correct 41 ms 44976 KB Output is correct
13 Correct 41 ms 44996 KB Output is correct
14 Correct 45 ms 46120 KB Output is correct
15 Correct 39 ms 47044 KB Output is correct
16 Correct 42 ms 46116 KB Output is correct
17 Correct 33 ms 44372 KB Output is correct
18 Correct 37 ms 44580 KB Output is correct
19 Correct 28 ms 44024 KB Output is correct
20 Correct 28 ms 44028 KB Output is correct
21 Correct 38 ms 44756 KB Output is correct
22 Correct 43 ms 45020 KB Output is correct
23 Correct 42 ms 51404 KB Output is correct
24 Correct 49 ms 55120 KB Output is correct
25 Correct 29 ms 43996 KB Output is correct
26 Correct 28 ms 44100 KB Output is correct
27 Correct 52 ms 56012 KB Output is correct
28 Correct 60 ms 52904 KB Output is correct
29 Correct 47 ms 46668 KB Output is correct
30 Correct 51 ms 51276 KB Output is correct
31 Correct 47 ms 48644 KB Output is correct
32 Correct 48 ms 44872 KB Output is correct
33 Correct 51 ms 44928 KB Output is correct
34 Correct 59 ms 47180 KB Output is correct
35 Correct 42 ms 45644 KB Output is correct
36 Correct 50 ms 46036 KB Output is correct
37 Correct 29 ms 44036 KB Output is correct
38 Correct 29 ms 44120 KB Output is correct
39 Correct 847 ms 44340 KB Output is correct
40 Correct 676 ms 44108 KB Output is correct
41 Correct 817 ms 44196 KB Output is correct
42 Correct 854 ms 44104 KB Output is correct
43 Correct 668 ms 44216 KB Output is correct
44 Correct 640 ms 44092 KB Output is correct
45 Correct 41 ms 44120 KB Output is correct
46 Correct 47 ms 44136 KB Output is correct
47 Execution timed out 1089 ms 44204 KB Time limit exceeded
48 Halted 0 ms 0 KB -