oj.uz

답안 #682270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682270 2023-01-16T05:36:35 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++17
9 / 100
 1000 ms 524288 KB 
#include "bits/stdc++.h"
using namespace std;

// #define ORD_SET
// #define ROPE
#ifdef ORD_SET
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    template<typename T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#ifdef ROPE
    #include <ext/rope>
    using namespace __gnu_cxx;
#endif        

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;//a
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
// #define ll int
void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
void NotInteractive() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
void pre(ll a) { cout<<fixed<<setprecision(a); }
ll bit(ll x) { return __builtin_popcountll(x); }
ll binpow(ll x, ll y, ll z) { ll pow = 1; while(y) { if(y&1) pow *= x, pow %= z; x *= x, x %= z; y >>= 1; } return pow; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct sn { ll l, r, x; }; // a.swap(b)
ll B = 316;
const ll mod = (ll)1e9+7;
const ll inf = (ll)1e18+7;
const ll MX = LLONG_MAX;
const ll MN = LLONG_MIN;
const ld P = acos(-1.0);
const ll N = (ll)3e5+5;
vector<ll> v[N];

void kigash() {
    ll n, m, q;
    cin>>n>>m>>q;
    while(q--) {
        ll t, l, r, c, k;
        cin>>t;
        if(t==1) {
            cin>>l>>r>>c>>k;
            for(ll i=l; i<=r; i++) {
                for(ll j=1; j<=k; j++) v[i].pb(c);
            }
        }
        else if(t==2) {
            cin>>l>>r>>k;
            for(ll i=l; i<=r; i++) {
                if(sz(v[i])<=k) v[i].clear();
                else {
                    vector<ll> tmp;
                    for(ll j=k; j<sz(v[i]); j++) tmp.pb(v[i][j]);
                    v[i] = tmp;
                }
            }
        }
        else {
            cin>>c>>k;
            // cout<<sz(v[c])<<" ";
            if(sz(v[c])>=k) cout<<v[c][k-1]<<"\n";
            else cout<<"0\n";
        }
    }
    return;
}

signed main(/**/) {
    // freopen("");
    NotInteractive();
    // precalc();
    
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) kigash();
    
    exit(0);
}

Compilation message

foodcourt.cpp: In function 'void freopen(std::string)':
foodcourt.cpp:31:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:31:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | 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 35 ms 7616 KB Output is correct
2 Correct 70 ms 7964 KB Output is correct
3 Correct 107 ms 13056 KB Output is correct
4 Correct 216 ms 14796 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 512 ms 16548 KB Output is correct
8 Correct 375 ms 13792 KB Output is correct
9 Correct 117 ms 8088 KB Output is correct
10 Correct 325 ms 13332 KB Output is correct
11 Correct 275 ms 10956 KB Output is correct
12 Correct 116 ms 8072 KB Output is correct
13 Correct 143 ms 7852 KB Output is correct
14 Correct 197 ms 9316 KB Output is correct
15 Correct 217 ms 9296 KB Output is correct
16 Correct 164 ms 8348 KB Output is correct
17 Correct 39 ms 7636 KB Output is correct
18 Correct 73 ms 7804 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7616 KB Output is correct
2 Correct 70 ms 7964 KB Output is correct
3 Correct 107 ms 13056 KB Output is correct
4 Correct 216 ms 14796 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 512 ms 16548 KB Output is correct
8 Correct 375 ms 13792 KB Output is correct
9 Correct 117 ms 8088 KB Output is correct
10 Correct 325 ms 13332 KB Output is correct
11 Correct 275 ms 10956 KB Output is correct
12 Correct 116 ms 8072 KB Output is correct
13 Correct 143 ms 7852 KB Output is correct
14 Correct 197 ms 9316 KB Output is correct
15 Correct 217 ms 9296 KB Output is correct
16 Correct 164 ms 8348 KB Output is correct
17 Correct 39 ms 7636 KB Output is correct
18 Correct 73 ms 7804 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Runtime error 399 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 501 ms 9144 KB Output is correct
2 Correct 388 ms 9232 KB Output is correct
3 Correct 506 ms 9268 KB Output is correct
4 Correct 514 ms 9364 KB Output is correct
5 Correct 391 ms 9420 KB Output is correct
6 Correct 382 ms 9424 KB Output is correct
7 Correct 17 ms 7384 KB Output is correct
8 Correct 18 ms 7436 KB Output is correct
9 Correct 932 ms 9112 KB Output is correct
10 Correct 829 ms 9936 KB Output is correct
11 Correct 813 ms 9976 KB Output is correct
12 Correct 850 ms 9996 KB Output is correct
13 Correct 157 ms 9668 KB Output is correct
14 Correct 240 ms 10164 KB Output is correct
15 Correct 48 ms 9416 KB Output is correct
16 Correct 57 ms 10144 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7616 KB Output is correct
2 Correct 70 ms 7964 KB Output is correct
3 Correct 107 ms 13056 KB Output is correct
4 Correct 216 ms 14796 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 512 ms 16548 KB Output is correct
8 Correct 375 ms 13792 KB Output is correct
9 Correct 117 ms 8088 KB Output is correct
10 Correct 325 ms 13332 KB Output is correct
11 Correct 275 ms 10956 KB Output is correct
12 Correct 116 ms 8072 KB Output is correct
13 Correct 143 ms 7852 KB Output is correct
14 Correct 197 ms 9316 KB Output is correct
15 Correct 217 ms 9296 KB Output is correct
16 Correct 164 ms 8348 KB Output is correct
17 Correct 39 ms 7636 KB Output is correct
18 Correct 73 ms 7804 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 501 ms 9144 KB Output is correct
22 Correct 388 ms 9232 KB Output is correct
23 Correct 506 ms 9268 KB Output is correct
24 Correct 514 ms 9364 KB Output is correct
25 Correct 391 ms 9420 KB Output is correct
26 Correct 382 ms 9424 KB Output is correct
27 Correct 17 ms 7384 KB Output is correct
28 Correct 18 ms 7436 KB Output is correct
29 Correct 932 ms 9112 KB Output is correct
30 Correct 829 ms 9936 KB Output is correct
31 Correct 813 ms 9976 KB Output is correct
32 Correct 850 ms 9996 KB Output is correct
33 Correct 157 ms 9668 KB Output is correct
34 Correct 240 ms 10164 KB Output is correct
35 Correct 48 ms 9416 KB Output is correct
36 Correct 57 ms 10144 KB Output is correct
37 Execution timed out 1049 ms 22552 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7616 KB Output is correct
2 Correct 70 ms 7964 KB Output is correct
3 Correct 107 ms 13056 KB Output is correct
4 Correct 216 ms 14796 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 512 ms 16548 KB Output is correct
8 Correct 375 ms 13792 KB Output is correct
9 Correct 117 ms 8088 KB Output is correct
10 Correct 325 ms 13332 KB Output is correct
11 Correct 275 ms 10956 KB Output is correct
12 Correct 116 ms 8072 KB Output is correct
13 Correct 143 ms 7852 KB Output is correct
14 Correct 197 ms 9316 KB Output is correct
15 Correct 217 ms 9296 KB Output is correct
16 Correct 164 ms 8348 KB Output is correct
17 Correct 39 ms 7636 KB Output is correct
18 Correct 73 ms 7804 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Runtime error 399 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7616 KB Output is correct
2 Correct 70 ms 7964 KB Output is correct
3 Correct 107 ms 13056 KB Output is correct
4 Correct 216 ms 14796 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 512 ms 16548 KB Output is correct
8 Correct 375 ms 13792 KB Output is correct
9 Correct 117 ms 8088 KB Output is correct
10 Correct 325 ms 13332 KB Output is correct
11 Correct 275 ms 10956 KB Output is correct
12 Correct 116 ms 8072 KB Output is correct
13 Correct 143 ms 7852 KB Output is correct
14 Correct 197 ms 9316 KB Output is correct
15 Correct 217 ms 9296 KB Output is correct
16 Correct 164 ms 8348 KB Output is correct
17 Correct 39 ms 7636 KB Output is correct
18 Correct 73 ms 7804 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Runtime error 399 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -