oj.uz

답안 #682238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682238 2023-01-16T05:00:46 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++17
2 / 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()
 
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<ll> 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++) {
				for (ll j = 1;j <= k;j++) {
					d[i].pb(c);
				}
			}
		} else if (tp == 2) {
			ll l, r, k; cin >> l >> r >> k;
			for (ll i = l;i <= r;i++) {
				for (ll j = 1;j <= k;j++) {
					if (d[i].empty()) br;
					d[i].pop_front();
				}
			}
		} else {
			ll a, b; cin >> a >> b;
			if (d[a].sz < b) {
				cout << 0 << en;
			} else {
				cout << d[a].at(b - 1) << 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 solve()':
foodcourt.cpp:79:16: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   79 |    if (d[a].sz < b) {
      |        ~~~~~~~~^~~
foodcourt.cpp: In function 'void freopen(std::string)':
foodcourt.cpp:48:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:48:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 44488 KB Output is correct
2 Correct 34 ms 44524 KB Output is correct
3 Correct 36 ms 47752 KB Output is correct
4 Correct 39 ms 49472 KB Output is correct
5 Correct 29 ms 43988 KB Output is correct
6 Correct 32 ms 43980 KB Output is correct
7 Correct 39 ms 49976 KB Output is correct
8 Correct 40 ms 48088 KB Output is correct
9 Correct 36 ms 44548 KB Output is correct
10 Correct 38 ms 47824 KB Output is correct
11 Correct 36 ms 46504 KB Output is correct
12 Correct 46 ms 44440 KB Output is correct
13 Correct 38 ms 45016 KB Output is correct
14 Correct 40 ms 45044 KB Output is correct
15 Correct 38 ms 45976 KB Output is correct
16 Correct 42 ms 45112 KB Output is correct
17 Correct 43 ms 44236 KB Output is correct
18 Correct 40 ms 44500 KB Output is correct
19 Correct 36 ms 44024 KB Output is correct
20 Correct 29 ms 43988 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 44488 KB Output is correct
2 Correct 34 ms 44524 KB Output is correct
3 Correct 36 ms 47752 KB Output is correct
4 Correct 39 ms 49472 KB Output is correct
5 Correct 29 ms 43988 KB Output is correct
6 Correct 32 ms 43980 KB Output is correct
7 Correct 39 ms 49976 KB Output is correct
8 Correct 40 ms 48088 KB Output is correct
9 Correct 36 ms 44548 KB Output is correct
10 Correct 38 ms 47824 KB Output is correct
11 Correct 36 ms 46504 KB Output is correct
12 Correct 46 ms 44440 KB Output is correct
13 Correct 38 ms 45016 KB Output is correct
14 Correct 40 ms 45044 KB Output is correct
15 Correct 38 ms 45976 KB Output is correct
16 Correct 42 ms 45112 KB Output is correct
17 Correct 43 ms 44236 KB Output is correct
18 Correct 40 ms 44500 KB Output is correct
19 Correct 36 ms 44024 KB Output is correct
20 Correct 29 ms 43988 KB Output is correct
21 Runtime error 279 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 798 ms 45184 KB Output is correct
2 Correct 616 ms 45220 KB Output is correct
3 Correct 787 ms 45292 KB Output is correct
4 Correct 751 ms 45388 KB Output is correct
5 Correct 592 ms 45264 KB Output is correct
6 Correct 639 ms 45336 KB Output is correct
7 Correct 44 ms 44748 KB Output is correct
8 Correct 43 ms 44808 KB Output is correct
9 Execution timed out 1087 ms 45360 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 61 ms 89192 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 44488 KB Output is correct
2 Correct 34 ms 44524 KB Output is correct
3 Correct 36 ms 47752 KB Output is correct
4 Correct 39 ms 49472 KB Output is correct
5 Correct 29 ms 43988 KB Output is correct
6 Correct 32 ms 43980 KB Output is correct
7 Correct 39 ms 49976 KB Output is correct
8 Correct 40 ms 48088 KB Output is correct
9 Correct 36 ms 44548 KB Output is correct
10 Correct 38 ms 47824 KB Output is correct
11 Correct 36 ms 46504 KB Output is correct
12 Correct 46 ms 44440 KB Output is correct
13 Correct 38 ms 45016 KB Output is correct
14 Correct 40 ms 45044 KB Output is correct
15 Correct 38 ms 45976 KB Output is correct
16 Correct 42 ms 45112 KB Output is correct
17 Correct 43 ms 44236 KB Output is correct
18 Correct 40 ms 44500 KB Output is correct
19 Correct 36 ms 44024 KB Output is correct
20 Correct 29 ms 43988 KB Output is correct
21 Correct 798 ms 45184 KB Output is correct
22 Correct 616 ms 45220 KB Output is correct
23 Correct 787 ms 45292 KB Output is correct
24 Correct 751 ms 45388 KB Output is correct
25 Correct 592 ms 45264 KB Output is correct
26 Correct 639 ms 45336 KB Output is correct
27 Correct 44 ms 44748 KB Output is correct
28 Correct 43 ms 44808 KB Output is correct
29 Execution timed out 1087 ms 45360 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 260 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 44488 KB Output is correct
2 Correct 34 ms 44524 KB Output is correct
3 Correct 36 ms 47752 KB Output is correct
4 Correct 39 ms 49472 KB Output is correct
5 Correct 29 ms 43988 KB Output is correct
6 Correct 32 ms 43980 KB Output is correct
7 Correct 39 ms 49976 KB Output is correct
8 Correct 40 ms 48088 KB Output is correct
9 Correct 36 ms 44548 KB Output is correct
10 Correct 38 ms 47824 KB Output is correct
11 Correct 36 ms 46504 KB Output is correct
12 Correct 46 ms 44440 KB Output is correct
13 Correct 38 ms 45016 KB Output is correct
14 Correct 40 ms 45044 KB Output is correct
15 Correct 38 ms 45976 KB Output is correct
16 Correct 42 ms 45112 KB Output is correct
17 Correct 43 ms 44236 KB Output is correct
18 Correct 40 ms 44500 KB Output is correct
19 Correct 36 ms 44024 KB Output is correct
20 Correct 29 ms 43988 KB Output is correct
21 Runtime error 279 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 44488 KB Output is correct
2 Correct 34 ms 44524 KB Output is correct
3 Correct 36 ms 47752 KB Output is correct
4 Correct 39 ms 49472 KB Output is correct
5 Correct 29 ms 43988 KB Output is correct
6 Correct 32 ms 43980 KB Output is correct
7 Correct 39 ms 49976 KB Output is correct
8 Correct 40 ms 48088 KB Output is correct
9 Correct 36 ms 44548 KB Output is correct
10 Correct 38 ms 47824 KB Output is correct
11 Correct 36 ms 46504 KB Output is correct
12 Correct 46 ms 44440 KB Output is correct
13 Correct 38 ms 45016 KB Output is correct
14 Correct 40 ms 45044 KB Output is correct
15 Correct 38 ms 45976 KB Output is correct
16 Correct 42 ms 45112 KB Output is correct
17 Correct 43 ms 44236 KB Output is correct
18 Correct 40 ms 44500 KB Output is correct
19 Correct 36 ms 44024 KB Output is correct
20 Correct 29 ms 43988 KB Output is correct
21 Runtime error 279 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -