oj.uz

Submission #682265

# Submission time Handle Problem Language Result Execution time Memory
682265 2023-01-16T05:35:08 Z vjudge1 Food Court (JOI21_foodcourt) C++17
2 / 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:18: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   18 | #pragma comment(linker, "/stack:200000000")
      | 
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

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7636 KB Output is correct
2 Correct 96 ms 7968 KB Output is correct
3 Correct 137 ms 13016 KB Output is correct
4 Correct 268 ms 14896 KB Output is correct
5 Correct 6 ms 7372 KB Output is correct
6 Correct 6 ms 7252 KB Output is correct
7 Correct 616 ms 16544 KB Output is correct
8 Correct 420 ms 13668 KB Output is correct
9 Correct 164 ms 8084 KB Output is correct
10 Correct 404 ms 13492 KB Output is correct
11 Correct 322 ms 10868 KB Output is correct
12 Correct 137 ms 8012 KB Output is correct
13 Correct 174 ms 7852 KB Output is correct
14 Correct 242 ms 9432 KB Output is correct
15 Correct 275 ms 9300 KB Output is correct
16 Correct 209 ms 8400 KB Output is correct
17 Correct 47 ms 7580 KB Output is correct
18 Correct 101 ms 7844 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 6 ms 7380 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7636 KB Output is correct
2 Correct 96 ms 7968 KB Output is correct
3 Correct 137 ms 13016 KB Output is correct
4 Correct 268 ms 14896 KB Output is correct
5 Correct 6 ms 7372 KB Output is correct
6 Correct 6 ms 7252 KB Output is correct
7 Correct 616 ms 16544 KB Output is correct
8 Correct 420 ms 13668 KB Output is correct
9 Correct 164 ms 8084 KB Output is correct
10 Correct 404 ms 13492 KB Output is correct
11 Correct 322 ms 10868 KB Output is correct
12 Correct 137 ms 8012 KB Output is correct
13 Correct 174 ms 7852 KB Output is correct
14 Correct 242 ms 9432 KB Output is correct
15 Correct 275 ms 9300 KB Output is correct
16 Correct 209 ms 8400 KB Output is correct
17 Correct 47 ms 7580 KB Output is correct
18 Correct 101 ms 7844 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 6 ms 7380 KB Output is correct
21 Runtime error 443 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 708 ms 9152 KB Output is correct
2 Correct 537 ms 10060 KB Output is correct
3 Correct 757 ms 10224 KB Output is correct
4 Correct 753 ms 10264 KB Output is correct
5 Correct 582 ms 10136 KB Output is correct
6 Correct 661 ms 10156 KB Output is correct
7 Correct 24 ms 8016 KB Output is correct
8 Correct 21 ms 8020 KB Output is correct
9 Execution timed out 1085 ms 9932 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7636 KB Output is correct
2 Correct 96 ms 7968 KB Output is correct
3 Correct 137 ms 13016 KB Output is correct
4 Correct 268 ms 14896 KB Output is correct
5 Correct 6 ms 7372 KB Output is correct
6 Correct 6 ms 7252 KB Output is correct
7 Correct 616 ms 16544 KB Output is correct
8 Correct 420 ms 13668 KB Output is correct
9 Correct 164 ms 8084 KB Output is correct
10 Correct 404 ms 13492 KB Output is correct
11 Correct 322 ms 10868 KB Output is correct
12 Correct 137 ms 8012 KB Output is correct
13 Correct 174 ms 7852 KB Output is correct
14 Correct 242 ms 9432 KB Output is correct
15 Correct 275 ms 9300 KB Output is correct
16 Correct 209 ms 8400 KB Output is correct
17 Correct 47 ms 7580 KB Output is correct
18 Correct 101 ms 7844 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 6 ms 7380 KB Output is correct
21 Correct 708 ms 9152 KB Output is correct
22 Correct 537 ms 10060 KB Output is correct
23 Correct 757 ms 10224 KB Output is correct
24 Correct 753 ms 10264 KB Output is correct
25 Correct 582 ms 10136 KB Output is correct
26 Correct 661 ms 10156 KB Output is correct
27 Correct 24 ms 8016 KB Output is correct
28 Correct 21 ms 8020 KB Output is correct
29 Execution timed out 1085 ms 9932 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 563 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 36 ms 7636 KB Output is correct
2 Correct 96 ms 7968 KB Output is correct
3 Correct 137 ms 13016 KB Output is correct
4 Correct 268 ms 14896 KB Output is correct
5 Correct 6 ms 7372 KB Output is correct
6 Correct 6 ms 7252 KB Output is correct
7 Correct 616 ms 16544 KB Output is correct
8 Correct 420 ms 13668 KB Output is correct
9 Correct 164 ms 8084 KB Output is correct
10 Correct 404 ms 13492 KB Output is correct
11 Correct 322 ms 10868 KB Output is correct
12 Correct 137 ms 8012 KB Output is correct
13 Correct 174 ms 7852 KB Output is correct
14 Correct 242 ms 9432 KB Output is correct
15 Correct 275 ms 9300 KB Output is correct
16 Correct 209 ms 8400 KB Output is correct
17 Correct 47 ms 7580 KB Output is correct
18 Correct 101 ms 7844 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 6 ms 7380 KB Output is correct
21 Runtime error 443 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7636 KB Output is correct
2 Correct 96 ms 7968 KB Output is correct
3 Correct 137 ms 13016 KB Output is correct
4 Correct 268 ms 14896 KB Output is correct
5 Correct 6 ms 7372 KB Output is correct
6 Correct 6 ms 7252 KB Output is correct
7 Correct 616 ms 16544 KB Output is correct
8 Correct 420 ms 13668 KB Output is correct
9 Correct 164 ms 8084 KB Output is correct
10 Correct 404 ms 13492 KB Output is correct
11 Correct 322 ms 10868 KB Output is correct
12 Correct 137 ms 8012 KB Output is correct
13 Correct 174 ms 7852 KB Output is correct
14 Correct 242 ms 9432 KB Output is correct
15 Correct 275 ms 9300 KB Output is correct
16 Correct 209 ms 8400 KB Output is correct
17 Correct 47 ms 7580 KB Output is correct
18 Correct 101 ms 7844 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 6 ms 7380 KB Output is correct
21 Runtime error 443 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -