oj.uz

답안 #682186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682186 2023-01-16T04:08:47 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;
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 34 ms 7636 KB Output is correct
2 Correct 71 ms 7980 KB Output is correct
3 Correct 101 ms 13092 KB Output is correct
4 Correct 256 ms 14880 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 608 ms 16584 KB Output is correct
8 Correct 365 ms 13772 KB Output is correct
9 Correct 117 ms 8140 KB Output is correct
10 Correct 355 ms 13404 KB Output is correct
11 Correct 284 ms 10956 KB Output is correct
12 Correct 121 ms 8092 KB Output is correct
13 Correct 142 ms 7892 KB Output is correct
14 Correct 216 ms 9348 KB Output is correct
15 Correct 215 ms 9368 KB Output is correct
16 Correct 173 ms 8392 KB Output is correct
17 Correct 38 ms 7624 KB Output is correct
18 Correct 75 ms 7848 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7508 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 7636 KB Output is correct
2 Correct 71 ms 7980 KB Output is correct
3 Correct 101 ms 13092 KB Output is correct
4 Correct 256 ms 14880 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 608 ms 16584 KB Output is correct
8 Correct 365 ms 13772 KB Output is correct
9 Correct 117 ms 8140 KB Output is correct
10 Correct 355 ms 13404 KB Output is correct
11 Correct 284 ms 10956 KB Output is correct
12 Correct 121 ms 8092 KB Output is correct
13 Correct 142 ms 7892 KB Output is correct
14 Correct 216 ms 9348 KB Output is correct
15 Correct 215 ms 9368 KB Output is correct
16 Correct 173 ms 8392 KB Output is correct
17 Correct 38 ms 7624 KB Output is correct
18 Correct 75 ms 7848 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7508 KB Output is correct
21 Runtime error 403 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 503 ms 10344 KB Output is correct
2 Correct 395 ms 10508 KB Output is correct
3 Correct 514 ms 10576 KB Output is correct
4 Correct 524 ms 10580 KB Output is correct
5 Correct 389 ms 10568 KB Output is correct
6 Correct 392 ms 10740 KB Output is correct
7 Correct 18 ms 8148 KB Output is correct
8 Correct 19 ms 8148 KB Output is correct
9 Correct 844 ms 10476 KB Output is correct
10 Correct 842 ms 10640 KB Output is correct
11 Correct 813 ms 10544 KB Output is correct
12 Correct 873 ms 10340 KB Output is correct
13 Correct 170 ms 9936 KB Output is correct
14 Correct 231 ms 10584 KB Output is correct
15 Correct 44 ms 10072 KB Output is correct
16 Correct 55 ms 10604 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 7636 KB Output is correct
2 Correct 71 ms 7980 KB Output is correct
3 Correct 101 ms 13092 KB Output is correct
4 Correct 256 ms 14880 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 608 ms 16584 KB Output is correct
8 Correct 365 ms 13772 KB Output is correct
9 Correct 117 ms 8140 KB Output is correct
10 Correct 355 ms 13404 KB Output is correct
11 Correct 284 ms 10956 KB Output is correct
12 Correct 121 ms 8092 KB Output is correct
13 Correct 142 ms 7892 KB Output is correct
14 Correct 216 ms 9348 KB Output is correct
15 Correct 215 ms 9368 KB Output is correct
16 Correct 173 ms 8392 KB Output is correct
17 Correct 38 ms 7624 KB Output is correct
18 Correct 75 ms 7848 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7508 KB Output is correct
21 Correct 503 ms 10344 KB Output is correct
22 Correct 395 ms 10508 KB Output is correct
23 Correct 514 ms 10576 KB Output is correct
24 Correct 524 ms 10580 KB Output is correct
25 Correct 389 ms 10568 KB Output is correct
26 Correct 392 ms 10740 KB Output is correct
27 Correct 18 ms 8148 KB Output is correct
28 Correct 19 ms 8148 KB Output is correct
29 Correct 844 ms 10476 KB Output is correct
30 Correct 842 ms 10640 KB Output is correct
31 Correct 813 ms 10544 KB Output is correct
32 Correct 873 ms 10340 KB Output is correct
33 Correct 170 ms 9936 KB Output is correct
34 Correct 231 ms 10584 KB Output is correct
35 Correct 44 ms 10072 KB Output is correct
36 Correct 55 ms 10604 KB Output is correct
37 Execution timed out 1083 ms 22664 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 7636 KB Output is correct
2 Correct 71 ms 7980 KB Output is correct
3 Correct 101 ms 13092 KB Output is correct
4 Correct 256 ms 14880 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 608 ms 16584 KB Output is correct
8 Correct 365 ms 13772 KB Output is correct
9 Correct 117 ms 8140 KB Output is correct
10 Correct 355 ms 13404 KB Output is correct
11 Correct 284 ms 10956 KB Output is correct
12 Correct 121 ms 8092 KB Output is correct
13 Correct 142 ms 7892 KB Output is correct
14 Correct 216 ms 9348 KB Output is correct
15 Correct 215 ms 9368 KB Output is correct
16 Correct 173 ms 8392 KB Output is correct
17 Correct 38 ms 7624 KB Output is correct
18 Correct 75 ms 7848 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7508 KB Output is correct
21 Runtime error 403 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 7636 KB Output is correct
2 Correct 71 ms 7980 KB Output is correct
3 Correct 101 ms 13092 KB Output is correct
4 Correct 256 ms 14880 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 608 ms 16584 KB Output is correct
8 Correct 365 ms 13772 KB Output is correct
9 Correct 117 ms 8140 KB Output is correct
10 Correct 355 ms 13404 KB Output is correct
11 Correct 284 ms 10956 KB Output is correct
12 Correct 121 ms 8092 KB Output is correct
13 Correct 142 ms 7892 KB Output is correct
14 Correct 216 ms 9348 KB Output is correct
15 Correct 215 ms 9368 KB Output is correct
16 Correct 173 ms 8392 KB Output is correct
17 Correct 38 ms 7624 KB Output is correct
18 Correct 75 ms 7848 KB Output is correct
19 Correct 5 ms 7384 KB Output is correct
20 Correct 5 ms 7508 KB Output is correct
21 Runtime error 403 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -