oj.uz

답안 #682396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682396 2023-01-16T08:00:49 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++17
7 / 100
 1000 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/rope>
using namespace __gnu_cxx;

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


typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

#define precise(a) cout<<fixed<<setprecision(a)
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
// t1
const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const ll N = ll(3e5)+10;
const ll K = 17;
const ll inf = 1e9;
const ld eps = 1e-15L;
//const ll B = 316;
ll lcm(ll a, ll b){ return (a / __gcd(a,b)) * b; }
//const ld P = acos(-1.0);

// ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;}
ld binpow(ld a, ll b){ ld res=1; while(b>0){ if(b&1)res=(res*a); a=(a*a); b/=2; } return res;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }



ll n, m, q; 
pll t[N*4];
ll u[N*4];
vector<pll>cus[N];
ll debt[N];

void precalc() {
	for(ll i=0; i<N*4; i++) t[i].ss = inf;
}

void update(ll v, ll tl, ll tr, ll l, ll r, ll x) {
	t[v].ff+=(tr-tl+1)*u[v];
	t[v].ss+=u[v];
	u[v+v]+=u[v];
	u[v+v+1]+=u[v];
	u[v] = 0;
    if(tl>r || l>tr) return;
    ll tm = (tl+tr)/2;
    if(l<=tl && tr<=r) {
		u[v]+=x;
    	if(tl==tr) {
    		t[v].ff = max(0ll, t[v].ff+u[v]);
    		t[v].ss = t[v].ff;
    	}
    	else {
    		if(t[v].ss+u[v]<0) {
    			update(v+v, tl, tm, l, r, x);
    			update(v+v+1, tm+1, tr, l, r, x);
    			t[v].ff = t[v+v].ff + t[v+v+1].ff;
    			t[v].ss = min(t[v+v].ss, t[v+v+1].ss);
    		}
    		else {
    			t[v].ss+=u[v];
    			t[v].ff+=(tr-tl+1)*u[v];
    			u[v+v]+=u[v];
				u[v+v+1]+=u[v];
    			u[v] = 0;
    		}
    	}
        return;
    }
    tm = (tl+tr)/2;
    update(v+v, tl, tm, l, r, x);
    update(v+v+1, tm+1, tr, l, r, x);
    t[v].ff = t[v+v].ff + t[v+v+1].ff;
    t[v].ss = min(t[v+v].ss, t[v+v+1].ss);
}

ll get(ll v, ll tl, ll tr, ll l, ll r) {
	t[v].ff+=(tr-tl+1)*u[v];
	t[v].ss+=u[v];
	u[v+v]+=u[v];
	u[v+v+1]+=u[v];
	u[v] = 0;
    if(tl>r || l>tr) return 0;
    if(l<=tl && tr<=r) return t[v].ff;
    ll tm = (tl+tr)/2;
    return get(v+v, tl, tm, l, r) + get(v+v+1, tm+1, tr, l, r);
}



void Baizho()
{   
    cin>>n>>m>>q;
    if(m==1) {
        while(q--) {
            ll t; cin>>t;
            if(t==1) {
                ll l, r, shop, k; cin>>l>>r>>shop>>k;
                update(1, 1, n, l, r, k);
            }
            else if(t==2) {
                ll l, r, k; cin>>l>>r>>k;
                update(1, 1, n, l, r, -k);
            }
            else {
                ll shop, pos; cin>>shop>>pos;
                ll cnt = get(1, 1, n, shop, shop);
                if(cnt<pos) cout<<"0\n";
                else cout<<"1\n";

            }
        }
        return;
    }
    while(q--) {
        ll t; cin>>t;
        if(t==1) {
            ll l, r, shop, k; cin>>l>>r>>shop>>k;
            for(ll i=l; i<=r; i++) {
                ll extra = 0;
                if(cus[i].sz) {
                    extra = cus[i].back().ff;
                    if(cus[i].back().ss==shop) {
                        cus[i].pop_back();
                    }
                }  
                cus[i].pb({k+extra, shop});
            }
        }
        else if(t==2) {
            ll l, r, k; cin>>l>>r>>k;
            for(ll i=l; i<=r; i++) {
                if(cus[i].sz) debt[i]+=min(cus[i].back().ff-debt[i], k);
            }
        }
        else {
            ll shop, pos; cin>>shop>>pos;
            pos+=debt[shop];
            if(cus[shop].sz==0) cout<<"0\n";
            else if(pos>cus[shop].back().ff) cout<<"0\n";
            else cout<<(*lower_bound(all(cus[shop]), make_pair(pos, 0ll))).ss<<"\n";
        }
    }
}

    
int main() {

    // Freopen("div7");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 

    precalc();

    int ttt = 1;
    // cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho();}
}

Compilation message

foodcourt.cpp: In function 'void Freopen(std::string)':
foodcourt.cpp:37:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:37:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31828 KB Output is correct
2 Correct 24 ms 37588 KB Output is correct
3 Correct 27 ms 39428 KB Output is correct
4 Correct 38 ms 50144 KB Output is correct
5 Correct 12 ms 26196 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 42 ms 43640 KB Output is correct
8 Correct 42 ms 43084 KB Output is correct
9 Correct 39 ms 43048 KB Output is correct
10 Correct 35 ms 44244 KB Output is correct
11 Correct 33 ms 44564 KB Output is correct
12 Correct 32 ms 43596 KB Output is correct
13 Correct 41 ms 51944 KB Output is correct
14 Correct 55 ms 57036 KB Output is correct
15 Correct 42 ms 41736 KB Output is correct
16 Correct 55 ms 56760 KB Output is correct
17 Correct 22 ms 35192 KB Output is correct
18 Correct 34 ms 39916 KB Output is correct
19 Correct 13 ms 26324 KB Output is correct
20 Correct 14 ms 26436 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31828 KB Output is correct
2 Correct 24 ms 37588 KB Output is correct
3 Correct 27 ms 39428 KB Output is correct
4 Correct 38 ms 50144 KB Output is correct
5 Correct 12 ms 26196 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 42 ms 43640 KB Output is correct
8 Correct 42 ms 43084 KB Output is correct
9 Correct 39 ms 43048 KB Output is correct
10 Correct 35 ms 44244 KB Output is correct
11 Correct 33 ms 44564 KB Output is correct
12 Correct 32 ms 43596 KB Output is correct
13 Correct 41 ms 51944 KB Output is correct
14 Correct 55 ms 57036 KB Output is correct
15 Correct 42 ms 41736 KB Output is correct
16 Correct 55 ms 56760 KB Output is correct
17 Correct 22 ms 35192 KB Output is correct
18 Correct 34 ms 39916 KB Output is correct
19 Correct 13 ms 26324 KB Output is correct
20 Correct 14 ms 26436 KB Output is correct
21 Correct 24 ms 36512 KB Output is correct
22 Correct 25 ms 37644 KB Output is correct
23 Correct 28 ms 41684 KB Output is correct
24 Correct 36 ms 50080 KB Output is correct
25 Correct 13 ms 26112 KB Output is correct
26 Correct 15 ms 26112 KB Output is correct
27 Correct 39 ms 40952 KB Output is correct
28 Correct 39 ms 43996 KB Output is correct
29 Correct 39 ms 43936 KB Output is correct
30 Correct 32 ms 43348 KB Output is correct
31 Correct 31 ms 40532 KB Output is correct
32 Correct 30 ms 40276 KB Output is correct
33 Correct 40 ms 50308 KB Output is correct
34 Correct 53 ms 56904 KB Output is correct
35 Correct 37 ms 48792 KB Output is correct
36 Correct 50 ms 56524 KB Output is correct
37 Correct 17 ms 26452 KB Output is correct
38 Correct 16 ms 26452 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 29568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1088 ms 34444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31828 KB Output is correct
2 Correct 24 ms 37588 KB Output is correct
3 Correct 27 ms 39428 KB Output is correct
4 Correct 38 ms 50144 KB Output is correct
5 Correct 12 ms 26196 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 42 ms 43640 KB Output is correct
8 Correct 42 ms 43084 KB Output is correct
9 Correct 39 ms 43048 KB Output is correct
10 Correct 35 ms 44244 KB Output is correct
11 Correct 33 ms 44564 KB Output is correct
12 Correct 32 ms 43596 KB Output is correct
13 Correct 41 ms 51944 KB Output is correct
14 Correct 55 ms 57036 KB Output is correct
15 Correct 42 ms 41736 KB Output is correct
16 Correct 55 ms 56760 KB Output is correct
17 Correct 22 ms 35192 KB Output is correct
18 Correct 34 ms 39916 KB Output is correct
19 Correct 13 ms 26324 KB Output is correct
20 Correct 14 ms 26436 KB Output is correct
21 Execution timed out 1090 ms 29568 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31828 KB Output is correct
2 Correct 24 ms 37588 KB Output is correct
3 Correct 27 ms 39428 KB Output is correct
4 Correct 38 ms 50144 KB Output is correct
5 Correct 12 ms 26196 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 42 ms 43640 KB Output is correct
8 Correct 42 ms 43084 KB Output is correct
9 Correct 39 ms 43048 KB Output is correct
10 Correct 35 ms 44244 KB Output is correct
11 Correct 33 ms 44564 KB Output is correct
12 Correct 32 ms 43596 KB Output is correct
13 Correct 41 ms 51944 KB Output is correct
14 Correct 55 ms 57036 KB Output is correct
15 Correct 42 ms 41736 KB Output is correct
16 Correct 55 ms 56760 KB Output is correct
17 Correct 22 ms 35192 KB Output is correct
18 Correct 34 ms 39916 KB Output is correct
19 Correct 13 ms 26324 KB Output is correct
20 Correct 14 ms 26436 KB Output is correct
21 Correct 24 ms 36512 KB Output is correct
22 Correct 25 ms 37644 KB Output is correct
23 Correct 28 ms 41684 KB Output is correct
24 Correct 36 ms 50080 KB Output is correct
25 Correct 13 ms 26112 KB Output is correct
26 Correct 15 ms 26112 KB Output is correct
27 Correct 39 ms 40952 KB Output is correct
28 Correct 39 ms 43996 KB Output is correct
29 Correct 39 ms 43936 KB Output is correct
30 Correct 32 ms 43348 KB Output is correct
31 Correct 31 ms 40532 KB Output is correct
32 Correct 30 ms 40276 KB Output is correct
33 Correct 40 ms 50308 KB Output is correct
34 Correct 53 ms 56904 KB Output is correct
35 Correct 37 ms 48792 KB Output is correct
36 Correct 50 ms 56524 KB Output is correct
37 Correct 17 ms 26452 KB Output is correct
38 Correct 16 ms 26452 KB Output is correct
39 Execution timed out 1090 ms 29568 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31828 KB Output is correct
2 Correct 24 ms 37588 KB Output is correct
3 Correct 27 ms 39428 KB Output is correct
4 Correct 38 ms 50144 KB Output is correct
5 Correct 12 ms 26196 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 42 ms 43640 KB Output is correct
8 Correct 42 ms 43084 KB Output is correct
9 Correct 39 ms 43048 KB Output is correct
10 Correct 35 ms 44244 KB Output is correct
11 Correct 33 ms 44564 KB Output is correct
12 Correct 32 ms 43596 KB Output is correct
13 Correct 41 ms 51944 KB Output is correct
14 Correct 55 ms 57036 KB Output is correct
15 Correct 42 ms 41736 KB Output is correct
16 Correct 55 ms 56760 KB Output is correct
17 Correct 22 ms 35192 KB Output is correct
18 Correct 34 ms 39916 KB Output is correct
19 Correct 13 ms 26324 KB Output is correct
20 Correct 14 ms 26436 KB Output is correct
21 Correct 24 ms 36512 KB Output is correct
22 Correct 25 ms 37644 KB Output is correct
23 Correct 28 ms 41684 KB Output is correct
24 Correct 36 ms 50080 KB Output is correct
25 Correct 13 ms 26112 KB Output is correct
26 Correct 15 ms 26112 KB Output is correct
27 Correct 39 ms 40952 KB Output is correct
28 Correct 39 ms 43996 KB Output is correct
29 Correct 39 ms 43936 KB Output is correct
30 Correct 32 ms 43348 KB Output is correct
31 Correct 31 ms 40532 KB Output is correct
32 Correct 30 ms 40276 KB Output is correct
33 Correct 40 ms 50308 KB Output is correct
34 Correct 53 ms 56904 KB Output is correct
35 Correct 37 ms 48792 KB Output is correct
36 Correct 50 ms 56524 KB Output is correct
37 Correct 17 ms 26452 KB Output is correct
38 Correct 16 ms 26452 KB Output is correct
39 Execution timed out 1090 ms 29568 KB Time limit exceeded
40 Halted 0 ms 0 KB -