oj.uz

답안 #160183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160183 2019-10-26T09:45:38 Z georgerapeanu Two Dishes (JOI19_dishes) C++11
74 / 100
 9795 ms 175752 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){/// += 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;
        aint[nod].sum = aint[nod].val;
        return ;
    }

    int mid = (st + dr) / 2;

    update_offset(nod * 2,st,mid,pos,delta);
    update_offset(nod * 2 + 1,mid + 1,dr,pos,delta);
    
    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 -1e18;
    }
    
    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);

    if(pos > n){
        return n + 1;
    }

    pair<long long,int> tmp = find_pos(1,0,n,-elem,pos);

    if(tmp.first + elem < 0){
        return n + 1;
    }

    assert(tmp.second >= pos);
    return tmp.second;
}

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]);
            event[pref_lin[i] + 1].push_back(i);
        }
    }
   
    for(int j = 1;j <= m;j++){
        for(auto it:event[j]){
            if(-p[it] > 0){
                int k = get_pos_sum(it,p[it]);
                if(k <= n){
                    assert(query_sum(1,0,n,it,k) + p[it] >= 0);
                    update_val(1,0,n,k,(query_sum(1,0,n,it,k) + p[it]) - get_val(1,0,n,k));
                    assert(get_val(1,0,n,k) >= 0);
                }
                if(it <= k - 1){
                    update_0(1,0,n,it,k - 1);
                }
                update_offset(1,0,n,it,-p[it]);
            }
            else{
                update_offset(1,0,n,it,-p[it]);
                update_val(1,0,n,it,+p[it]);
            }
        }
        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 '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);
             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 588 ms 55160 KB Output is correct
2 Correct 797 ms 54904 KB Output is correct
3 Correct 301 ms 52464 KB Output is correct
4 Correct 421 ms 54804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 801 ms 54024 KB Output is correct
7 Correct 54 ms 29432 KB Output is correct
8 Correct 158 ms 46960 KB Output is correct
9 Correct 300 ms 52464 KB Output is correct
10 Correct 916 ms 57700 KB Output is correct
11 Correct 290 ms 52464 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23952 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 26 ms 23900 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 23940 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23800 KB Output is correct
14 Correct 25 ms 23800 KB Output is correct
15 Correct 25 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23952 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 26 ms 23900 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 23940 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23800 KB Output is correct
14 Correct 25 ms 23800 KB Output is correct
15 Correct 25 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 27 ms 24184 KB Output is correct
18 Correct 26 ms 24188 KB Output is correct
19 Correct 32 ms 24184 KB Output is correct
20 Correct 29 ms 24060 KB Output is correct
21 Correct 29 ms 24156 KB Output is correct
22 Correct 30 ms 24184 KB Output is correct
23 Correct 31 ms 24188 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23952 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 26 ms 23900 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 23940 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23800 KB Output is correct
14 Correct 25 ms 23800 KB Output is correct
15 Correct 25 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 27 ms 24184 KB Output is correct
18 Correct 26 ms 24188 KB Output is correct
19 Correct 32 ms 24184 KB Output is correct
20 Correct 29 ms 24060 KB Output is correct
21 Correct 29 ms 24156 KB Output is correct
22 Correct 30 ms 24184 KB Output is correct
23 Correct 31 ms 24188 KB Output is correct
24 Correct 451 ms 52420 KB Output is correct
25 Correct 422 ms 51828 KB Output is correct
26 Correct 436 ms 57640 KB Output is correct
27 Correct 393 ms 51916 KB Output is correct
28 Correct 610 ms 53204 KB Output is correct
29 Correct 291 ms 52636 KB Output is correct
30 Correct 1517 ms 55288 KB Output is correct
31 Correct 59 ms 29432 KB Output is correct
32 Correct 232 ms 46836 KB Output is correct
33 Correct 859 ms 53740 KB Output is correct
34 Correct 981 ms 53748 KB Output is correct
35 Correct 1534 ms 55160 KB Output is correct
36 Correct 1442 ms 55204 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23952 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 26 ms 23900 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 23940 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23800 KB Output is correct
14 Correct 25 ms 23800 KB Output is correct
15 Correct 25 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 27 ms 24184 KB Output is correct
18 Correct 26 ms 24188 KB Output is correct
19 Correct 32 ms 24184 KB Output is correct
20 Correct 29 ms 24060 KB Output is correct
21 Correct 29 ms 24156 KB Output is correct
22 Correct 30 ms 24184 KB Output is correct
23 Correct 31 ms 24188 KB Output is correct
24 Correct 451 ms 52420 KB Output is correct
25 Correct 422 ms 51828 KB Output is correct
26 Correct 436 ms 57640 KB Output is correct
27 Correct 393 ms 51916 KB Output is correct
28 Correct 610 ms 53204 KB Output is correct
29 Correct 291 ms 52636 KB Output is correct
30 Correct 1517 ms 55288 KB Output is correct
31 Correct 59 ms 29432 KB Output is correct
32 Correct 232 ms 46836 KB Output is correct
33 Correct 859 ms 53740 KB Output is correct
34 Correct 981 ms 53748 KB Output is correct
35 Correct 1534 ms 55160 KB Output is correct
36 Correct 1442 ms 55204 KB Output is correct
37 Correct 448 ms 57564 KB Output is correct
38 Correct 395 ms 51832 KB Output is correct
39 Correct 1054 ms 57464 KB Output is correct
40 Correct 852 ms 57708 KB Output is correct
41 Correct 25 ms 23800 KB Output is correct
42 Correct 1534 ms 55212 KB Output is correct
43 Correct 840 ms 53624 KB Output is correct
44 Correct 977 ms 53572 KB Output is correct
45 Correct 1539 ms 55224 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23952 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 26 ms 23900 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23800 KB Output is correct
10 Correct 23 ms 23940 KB Output is correct
11 Correct 24 ms 23800 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23800 KB Output is correct
14 Correct 25 ms 23800 KB Output is correct
15 Correct 25 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 27 ms 24184 KB Output is correct
18 Correct 26 ms 24188 KB Output is correct
19 Correct 32 ms 24184 KB Output is correct
20 Correct 29 ms 24060 KB Output is correct
21 Correct 29 ms 24156 KB Output is correct
22 Correct 30 ms 24184 KB Output is correct
23 Correct 31 ms 24188 KB Output is correct
24 Correct 451 ms 52420 KB Output is correct
25 Correct 422 ms 51828 KB Output is correct
26 Correct 436 ms 57640 KB Output is correct
27 Correct 393 ms 51916 KB Output is correct
28 Correct 610 ms 53204 KB Output is correct
29 Correct 291 ms 52636 KB Output is correct
30 Correct 1517 ms 55288 KB Output is correct
31 Correct 59 ms 29432 KB Output is correct
32 Correct 232 ms 46836 KB Output is correct
33 Correct 859 ms 53740 KB Output is correct
34 Correct 981 ms 53748 KB Output is correct
35 Correct 1534 ms 55160 KB Output is correct
36 Correct 1442 ms 55204 KB Output is correct
37 Correct 448 ms 57564 KB Output is correct
38 Correct 395 ms 51832 KB Output is correct
39 Correct 1054 ms 57464 KB Output is correct
40 Correct 852 ms 57708 KB Output is correct
41 Correct 25 ms 23800 KB Output is correct
42 Correct 1534 ms 55212 KB Output is correct
43 Correct 840 ms 53624 KB Output is correct
44 Correct 977 ms 53572 KB Output is correct
45 Correct 1539 ms 55224 KB Output is correct
46 Correct 2348 ms 175752 KB Output is correct
47 Correct 2097 ms 146616 KB Output is correct
48 Correct 5927 ms 175736 KB Output is correct
49 Correct 4693 ms 175720 KB Output is correct
50 Correct 9795 ms 164088 KB Output is correct
51 Correct 5097 ms 154312 KB Output is correct
52 Correct 5735 ms 152568 KB Output is correct
53 Correct 9544 ms 163844 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 588 ms 55160 KB Output is correct
2 Correct 797 ms 54904 KB Output is correct
3 Correct 301 ms 52464 KB Output is correct
4 Correct 421 ms 54804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 801 ms 54024 KB Output is correct
7 Correct 54 ms 29432 KB Output is correct
8 Correct 158 ms 46960 KB Output is correct
9 Correct 300 ms 52464 KB Output is correct
10 Correct 916 ms 57700 KB Output is correct
11 Correct 290 ms 52464 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23952 KB Output is correct
14 Correct 25 ms 23928 KB Output is correct
15 Correct 26 ms 23900 KB Output is correct
16 Correct 23 ms 23800 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23928 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Correct 23 ms 23940 KB Output is correct
22 Correct 24 ms 23800 KB Output is correct
23 Correct 24 ms 23800 KB Output is correct
24 Correct 24 ms 23800 KB Output is correct
25 Correct 25 ms 23800 KB Output is correct
26 Correct 25 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 27 ms 24184 KB Output is correct
29 Correct 26 ms 24188 KB Output is correct
30 Correct 32 ms 24184 KB Output is correct
31 Correct 29 ms 24060 KB Output is correct
32 Correct 29 ms 24156 KB Output is correct
33 Correct 30 ms 24184 KB Output is correct
34 Correct 31 ms 24188 KB Output is correct
35 Correct 451 ms 52420 KB Output is correct
36 Correct 422 ms 51828 KB Output is correct
37 Correct 436 ms 57640 KB Output is correct
38 Correct 393 ms 51916 KB Output is correct
39 Correct 610 ms 53204 KB Output is correct
40 Correct 291 ms 52636 KB Output is correct
41 Correct 1517 ms 55288 KB Output is correct
42 Correct 59 ms 29432 KB Output is correct
43 Correct 232 ms 46836 KB Output is correct
44 Correct 859 ms 53740 KB Output is correct
45 Correct 981 ms 53748 KB Output is correct
46 Correct 1534 ms 55160 KB Output is correct
47 Correct 1442 ms 55204 KB Output is correct
48 Correct 448 ms 57564 KB Output is correct
49 Correct 395 ms 51832 KB Output is correct
50 Correct 1054 ms 57464 KB Output is correct
51 Correct 852 ms 57708 KB Output is correct
52 Correct 25 ms 23800 KB Output is correct
53 Correct 1534 ms 55212 KB Output is correct
54 Correct 840 ms 53624 KB Output is correct
55 Correct 977 ms 53572 KB Output is correct
56 Correct 1539 ms 55224 KB Output is correct
57 Correct 502 ms 57652 KB Output is correct
58 Correct 643 ms 51988 KB Output is correct
59 Incorrect 848 ms 57664 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 588 ms 55160 KB Output is correct
2 Correct 797 ms 54904 KB Output is correct
3 Correct 301 ms 52464 KB Output is correct
4 Correct 421 ms 54804 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 801 ms 54024 KB Output is correct
7 Correct 54 ms 29432 KB Output is correct
8 Correct 158 ms 46960 KB Output is correct
9 Correct 300 ms 52464 KB Output is correct
10 Correct 916 ms 57700 KB Output is correct
11 Correct 290 ms 52464 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23952 KB Output is correct
14 Correct 25 ms 23928 KB Output is correct
15 Correct 26 ms 23900 KB Output is correct
16 Correct 23 ms 23800 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23928 KB Output is correct
20 Correct 23 ms 23800 KB Output is correct
21 Correct 23 ms 23940 KB Output is correct
22 Correct 24 ms 23800 KB Output is correct
23 Correct 24 ms 23800 KB Output is correct
24 Correct 24 ms 23800 KB Output is correct
25 Correct 25 ms 23800 KB Output is correct
26 Correct 25 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 27 ms 24184 KB Output is correct
29 Correct 26 ms 24188 KB Output is correct
30 Correct 32 ms 24184 KB Output is correct
31 Correct 29 ms 24060 KB Output is correct
32 Correct 29 ms 24156 KB Output is correct
33 Correct 30 ms 24184 KB Output is correct
34 Correct 31 ms 24188 KB Output is correct
35 Correct 451 ms 52420 KB Output is correct
36 Correct 422 ms 51828 KB Output is correct
37 Correct 436 ms 57640 KB Output is correct
38 Correct 393 ms 51916 KB Output is correct
39 Correct 610 ms 53204 KB Output is correct
40 Correct 291 ms 52636 KB Output is correct
41 Correct 1517 ms 55288 KB Output is correct
42 Correct 59 ms 29432 KB Output is correct
43 Correct 232 ms 46836 KB Output is correct
44 Correct 859 ms 53740 KB Output is correct
45 Correct 981 ms 53748 KB Output is correct
46 Correct 1534 ms 55160 KB Output is correct
47 Correct 1442 ms 55204 KB Output is correct
48 Correct 448 ms 57564 KB Output is correct
49 Correct 395 ms 51832 KB Output is correct
50 Correct 1054 ms 57464 KB Output is correct
51 Correct 852 ms 57708 KB Output is correct
52 Correct 25 ms 23800 KB Output is correct
53 Correct 1534 ms 55212 KB Output is correct
54 Correct 840 ms 53624 KB Output is correct
55 Correct 977 ms 53572 KB Output is correct
56 Correct 1539 ms 55224 KB Output is correct
57 Correct 2348 ms 175752 KB Output is correct
58 Correct 2097 ms 146616 KB Output is correct
59 Correct 5927 ms 175736 KB Output is correct
60 Correct 4693 ms 175720 KB Output is correct
61 Correct 9795 ms 164088 KB Output is correct
62 Correct 5097 ms 154312 KB Output is correct
63 Correct 5735 ms 152568 KB Output is correct
64 Correct 9544 ms 163844 KB Output is correct
65 Correct 502 ms 57652 KB Output is correct
66 Correct 643 ms 51988 KB Output is correct
67 Incorrect 848 ms 57664 KB Output isn't correct
68 Halted 0 ms 0 KB -