oj.uz

답안 #160173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160173 2019-10-26T08:46:00 Z georgerapeanu Two Dishes (JOI19_dishes) C++11
5 / 100
 999 ms 57584 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cassert>

using namespace std;

const int NMAX = 1e6;

int n,m;
int a[NMAX + 5];
int b[NMAX + 5];
int p[NMAX + 5];
int q[NMAX + 5];
long long s[NMAX + 5];
long long t[NMAX + 5];

int pref_lin[NMAX + 5];
int pref_col[NMAX + 5];

long long pref_sum_a[NMAX + 5];
long long pref_sum_b[NMAX + 5];

vector<int> event[NMAX + 5];

struct node_t{
    long long base_offset;
    long long sum;
    long long val;
    int lazy;

    node_t operator + (const node_t &other)const{
        node_t ans;
        ans.base_offset = 0;
        ans.sum = (this->sum) + other.sum;
        ans.val = 0;
        ans.lazy = 0;
        return ans;
    }
}aint[4 * NMAX + 5];

void propag(int nod,int st,int dr){
    assert(0 <= st && st <= dr && dr <= n);
    assert(nod <= 4 * NMAX);
    if(st == dr || aint[nod].lazy == 0){
        return ;
    }
    
    aint[2 * nod].lazy |= aint[nod].lazy;
    aint[2 * nod + 1].lazy |= aint[nod].lazy;
    
    aint[2 * nod].val = aint[2 * nod].sum = 0;
    aint[2 * nod + 1].val = aint[2 * nod + 1].sum = 0;

    aint[nod].lazy = 0;
}

void build(int nod,int st,int dr){
    assert(0 <= st && st <= dr && dr <= n);
    assert(nod <= 4 * NMAX);
    aint[nod].base_offset = 0;
    aint[nod].sum = 0;
    aint[nod].val = 0;
    aint[nod].lazy = 0;

    if(st == dr){
        return ;
    }

    int mid = (st + dr) / 2;

    build(nod * 2,st,mid);
    build(nod * 2 + 1,mid + 1,dr);
}

void update_val(int nod,int st,int dr,int pos,long long delta){///+= delta
    assert(0 <= st && st <= dr && dr <= n);
    assert(nod <= 4 * NMAX);
    assert(0 <= pos && pos <= n);
    propag(nod,st,dr);

    if(dr < pos || st > pos){
        return ;
    }

    if(st == dr){
        aint[nod].val += delta;
        if(st != 0)aint[nod].val = max(0LL,aint[nod].val);
        aint[nod].sum = aint[nod].val;
        return ;
    }

    int mid = (st + dr) / 2;

    update_val(nod * 2,st,mid,pos,delta);
    update_val(nod * 2 + 1,mid + 1,dr,pos,delta);
        
    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}

void update_offset(int nod,int st,int dr,int pos,int delta,bool initial = false){/// += delta_offset
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    assert(0 <= pos && pos <= n);
    propag(nod,st,dr);
    if(dr < pos || st > pos){
        return ;
    }

    if(st == dr){
        aint[nod].base_offset += delta;
        if(initial == false){
            aint[nod].val -= delta;
            aint[nod].val = max(aint[nod].val,0LL);
        }
        aint[nod].sum = aint[nod].val;
        return ;
    }

    int mid = (st + dr) / 2;

    update_offset(nod * 2,st,mid,pos,delta,initial);
    update_offset(nod * 2 + 1,mid + 1,dr,pos,delta,initial);
    
    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}

void update_0(int nod,int st,int dr,int l,int r){
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    assert(0 <= l && l <= r && r <= n);
    propag(nod,st,dr);
    if(r < st || l > dr){
        return ;
    }
    if(l <= st && dr <= r){
        aint[nod].lazy = 1;
        aint[nod].sum = 0;
        aint[nod].val = 0;
        return ;
    }

    int mid = (st + dr) / 2;

    update_0(nod * 2,st,mid,l,r);
    update_0(nod * 2 + 1,mid + 1,dr,l,r);

    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
long long query_sum(int nod,int st,int dr,int l,int r){
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    if((0 <= l && l <= r && r <= n) == false){aint[10000 * NMAX + 5].sum = -1;}
    assert(0 <= l && l <= r && r <= n);
    propag(nod,st,dr);
    if(r < st || l > dr){
        return 0;
    }
    
    if(l <= st && dr <= r){
        return aint[nod].sum;
    }
    
    int mid = (st + dr) / 2;

    return query_sum(nod * 2,st,mid,l,r) + query_sum(nod * 2 + 1,mid + 1,dr,l,r);
}

long long get_val(int nod,int st,int dr,int pos){
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    assert(0 <= pos && pos <= n);
    propag(nod,st,dr);
    if(dr < pos || st > pos){
        return -1;
    }
    
    if(st == dr){
        return aint[nod].val;
    }

    int mid = (st + dr) / 2;

    return max(get_val(nod * 2,st,mid,pos),get_val(nod * 2 + 1,mid + 1,dr,pos));
}

pair<long long,int> find_pos(int nod,int st,int dr,long long sum,int pos){
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    assert(0 <= pos && pos <= n);
    propag(nod,st,dr);

    if(st == dr){
        return {aint[nod].sum,st};
    }

    int mid = (st + dr) / 2;

    if(st <= pos && pos <= dr){
        if(pos <= mid){
            pair<long long,int> tmp = find_pos(nod * 2,st,mid,sum,pos);
            if(tmp.first < sum){
                if(aint[nod * 2 + 1].sum + tmp.first >= sum){
                    pair<long long,int> tmp_fiu = find_pos(nod * 2 + 1,mid + 1,dr,sum - tmp.first,pos);
                    tmp.first += tmp_fiu.first;
                    tmp.second = tmp_fiu.second;
                    return tmp;
                }
                else{
                    tmp.first += aint[nod * 2 + 1].sum;
                    tmp.second = dr;
                    return tmp;
                }
            }
            else{
                return tmp;
            }
        }
        else{
            return find_pos(nod * 2 + 1,mid + 1,dr,sum,pos);
        }
    }
    else{
        if(aint[nod * 2].sum >= sum){
            return find_pos(nod * 2,st,mid,sum,pos);
        }
        else{
            pair<long long,int> tmp = find_pos(nod * 2 + 1,mid + 1,dr,sum - aint[nod * 2].sum,pos);
            tmp.first += aint[nod * 2].sum;
            return tmp;
        }
    }

}

int get_pos_sum(int pos,long long elem){
    if((1 <= pos && pos <= n + 1) == false){printf("%d\n",pos);fflush(stdout);aint[10000 * NMAX + 5].sum = -1;}
    assert(1 <= pos && pos <= n + 1);

    long long base_sum = query_sum(1,0,n,0,pos - 1) - elem;
    if(aint[1].sum < base_sum || pos == n + 1){
        return n + 1;
    }
        
    int tmp = find_pos(1,0,n,base_sum,pos).second;
    assert(tmp >= pos);
    return tmp;
}

long long get_time(int i,int j){
    assert(0 <= i && i <= n && 0 <= j && j <= m);
    return pref_sum_a[i] + pref_sum_b[j];
}

long long get_ans(int nod,int st,int dr){
    assert(nod <= 4 * NMAX);
    assert(0 <= st && st <= dr && dr <= n);
    propag(nod,st,dr);
    if(st == dr){
        return (aint[nod].val + aint[nod].base_offset);
    }

    int mid = (st + dr) / 2;

    return get_ans(nod * 2,st,mid) + get_ans(nod * 2 + 1,mid + 1,dr);
}

const int LEN = 1 << 12;
char buff[LEN];
int ind = LEN - 1;

int i32(){
    int ans = 0;
    int sgn = 1;

    while(buff[ind] != '-' && ('0' > buff[ind] || '9' < buff[ind])){
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }

    if(buff[ind] == '-'){
        sgn = -1;
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    
    while('0' <= buff[ind] && '9' >= buff[ind]){
        ans = ans * 10 + (buff[ind] - '0');
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }

    return ans * sgn;
}

long long i64(){
    long long ans = 0;
    int sgn = 1;

    while(buff[ind] != '-' && ('0' > buff[ind] || '9' < buff[ind])){
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }

    if(buff[ind] == '-'){
        sgn = -1;
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    
    while('0' <= buff[ind] && '9' >= buff[ind]){
        ans = ans * 10 + (buff[ind] - '0');
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }

    return ans * sgn;
}

int main(){

    n = i32();m = i32();
    
    for(int i = 1;i <= n;i++){
        a[i] = i32();s[i] = i64();p[i] = i32();
        pref_sum_a[i] = a[i] + pref_sum_a[i - 1];
    }
    
    for(int i = 1;i <= m;i++){
        b[i] = i32();t[i] = i64();q[i] = i32();
        pref_sum_b[i] = b[i] + pref_sum_b[i - 1];
    }

    for(int j = 0;j <= m;j++){
        int l = -1,r = n + 1;
        while(r - l > 1){
            int mid = (l + r) / 2;
            if(get_time(mid,j) <= t[j]){
                l = mid;
            }
            else{
                r = mid;
            }
        }

        pref_col[j] =  l;
    }


    for(int i = 0;i <= n;i++){
        int l = -1,r = m + 1;

        while(r - l > 1){
            int mid = (l + r) / 2;
            if(get_time(i,mid) <= s[i]){
                l = mid;
            }
            else{
                r = mid;
            }
        }

        pref_lin[i] = l;
    }

    build(1,0,n);

    for(int i = 1;i <= n;i++){
        if(pref_lin[i] > -1){
            update_offset(1,0,n,i,p[i],true);
            event[pref_lin[i] + 1].push_back(i);
        }
    }
   
    for(int j = 1;j <= m;j++){
        for(auto it:event[j]){
            update_offset(1,0,n,it,-p[it]);
            if(-p[it] > 0){
                int k = get_pos_sum(it + 1,p[it]);
                if(k <= n){
                    assert(query_sum(1,0,n,it + 1,k) + p[it] >= 0);
                    update_val(1,0,n,k,(query_sum(1,0,n,it + 1,k) + p[it]) - get_val(1,0,n,k));
                    assert(get_val(1,0,n,k) >= 0);
                }
                if(it + 1 <= k - 1){
                    update_0(1,0,n,it + 1,k - 1);
                }
            }
        }
        if(pref_col[j] > -1){
            update_val(1,0,n,0,q[j]);
            int k = get_pos_sum(pref_col[j] + 1,-q[j]);
            if(k <= n){
                assert(query_sum(1,0,n,pref_col[j] + 1,k) - q[j] >= 0);
                update_val(1,0,n,k,(query_sum(1,0,n,pref_col[j] + 1,k) - q[j]) - get_val(1,0,n,k));
                assert(get_val(1,0,n,k) >= 0);
            }
            if(pref_col[j] + 1 <= k - 1){
                update_0(1,0,n,pref_col[j] + 1,k - 1);
            }
        }
    }

    printf("%lld\n",get_ans(1,0,n));

    return 0;
}

Compilation message

dishes.cpp: In function 'long long int query_sum(int, int, int, int, int)':
dishes.cpp:153:58: warning: integer overflow in expression [-Woverflow]
     if((0 <= l && l <= r && r <= n) == false){aint[10000 * NMAX + 5].sum = -1;}
                                                    ~~~~~~^~~~~~
dishes.cpp: In function 'int get_pos_sum(int, long long int)':
dishes.cpp:237:90: warning: integer overflow in expression [-Woverflow]
     if((1 <= pos && pos <= n + 1) == false){printf("%d\n",pos);fflush(stdout);aint[10000 * NMAX + 5].sum = -1;}
                                                                                    ~~~~~~^~~~~~
dishes.cpp: In function 'int i32()':
dishes.cpp:279:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:287:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:295:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp: In function 'long long int i64()':
dishes.cpp:309:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:317:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:325:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp: In function 'long long int query_sum(int, int, int, int, int)':
dishes.cpp:153:68: warning: array subscript is above array bounds [-Warray-bounds]
     if((0 <= l && l <= r && r <= n) == false){aint[10000 * NMAX + 5].sum = -1;}
                                               ~~~~~~~~~~~~~~~~~~~~~^
dishes.cpp: In function 'int get_pos_sum(int, long long int)':
dishes.cpp:237:100: warning: array subscript is above array bounds [-Warray-bounds]
     if((1 <= pos && pos <= n + 1) == false){printf("%d\n",pos);fflush(stdout);aint[10000 * NMAX + 5].sum = -1;}
                                                                               ~~~~~~~~~~~~~~~~~~~~~^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 539 ms 55160 KB Output is correct
2 Correct 929 ms 54908 KB Output is correct
3 Correct 316 ms 52556 KB Output is correct
4 Correct 401 ms 55160 KB Output is correct
5 Correct 24 ms 23932 KB Output is correct
6 Correct 797 ms 54164 KB Output is correct
7 Correct 57 ms 29432 KB Output is correct
8 Correct 162 ms 46948 KB Output is correct
9 Correct 310 ms 52464 KB Output is correct
10 Correct 999 ms 57584 KB Output is correct
11 Correct 303 ms 52436 KB Output is correct

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23900 KB Output is correct
4 Correct 26 ms 23844 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 26 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Incorrect 22 ms 23800 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23900 KB Output is correct
4 Correct 26 ms 23844 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 26 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Incorrect 22 ms 23800 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23900 KB Output is correct
4 Correct 26 ms 23844 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 26 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Incorrect 22 ms 23800 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23900 KB Output is correct
4 Correct 26 ms 23844 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 26 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Incorrect 22 ms 23800 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23900 KB Output is correct
4 Correct 26 ms 23844 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 26 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Incorrect 22 ms 23800 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 539 ms 55160 KB Output is correct
2 Correct 929 ms 54908 KB Output is correct
3 Correct 316 ms 52556 KB Output is correct
4 Correct 401 ms 55160 KB Output is correct
5 Correct 24 ms 23932 KB Output is correct
6 Correct 797 ms 54164 KB Output is correct
7 Correct 57 ms 29432 KB Output is correct
8 Correct 162 ms 46948 KB Output is correct
9 Correct 310 ms 52464 KB Output is correct
10 Correct 999 ms 57584 KB Output is correct
11 Correct 303 ms 52436 KB Output is correct
12 Correct 26 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 24 ms 23900 KB Output is correct
15 Correct 26 ms 23844 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 24 ms 23800 KB Output is correct
19 Correct 26 ms 23928 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Incorrect 22 ms 23800 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 539 ms 55160 KB Output is correct
2 Correct 929 ms 54908 KB Output is correct
3 Correct 316 ms 52556 KB Output is correct
4 Correct 401 ms 55160 KB Output is correct
5 Correct 24 ms 23932 KB Output is correct
6 Correct 797 ms 54164 KB Output is correct
7 Correct 57 ms 29432 KB Output is correct
8 Correct 162 ms 46948 KB Output is correct
9 Correct 310 ms 52464 KB Output is correct
10 Correct 999 ms 57584 KB Output is correct
11 Correct 303 ms 52436 KB Output is correct
12 Correct 26 ms 23800 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 24 ms 23900 KB Output is correct
15 Correct 26 ms 23844 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 24 ms 23800 KB Output is correct
19 Correct 26 ms 23928 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Incorrect 22 ms 23800 KB Output isn't correct
22 Halted 0 ms 0 KB -