oj.uz

답안 #160354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160354 2019-10-27T06:19:23 Z georgerapeanu Two Dishes (JOI19_dishes) C++11
74 / 100
 7525 ms 177604 KB 
#include <cstdio>
#include <algorithm>
#include <vector>

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) {
    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) {
    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
    propag(nod,st,dr);

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

    if(st == dr) {
        aint[nod].val += delta;
        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
    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) {
    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) {
    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) {
    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) {
    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 {
            pair<long long,int> tmp = find_pos(nod * 2 + 1,mid + 1,dr,sum,pos);
            return tmp;
        }
    }
    else {
        if(aint[nod * 2].sum >= sum) {
            pair<long long,int> tmp = find_pos(nod * 2,st,mid,sum,pos);
            return tmp;
        }
        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(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;
    }

    return tmp.second;
}

long long get_time(int i,int j) {
    return pref_sum_a[i] + pref_sum_b[j];
}

long long get_ans(int nod,int st,int dr) {
    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;
}

void afis(int nod,int st,int dr,long long &sum){
    propag(nod,st,dr);
    if(st == dr){
        sum += aint[nod].val + aint[nod].base_offset;
    //    printf("%lld ",sum);
        printf("(%lld,%lld) ",aint[nod].val,aint[nod].base_offset);
        return ;
    }
    
    int mid = (st + dr) / 2;
    afis(nod * 2,st,mid,sum);
    afis(nod * 2 + 1,mid + 1,dr,sum);
}

int main() {

    m = i32();
    n = i32();

    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 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 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);
        }
    }

//    long long tmp = 0;afis(1,0,n,tmp);printf("\n");
    for(int j = 1; j <= m; j++) {
        for(auto it:event[j]) {
   //         printf("event rem offset on %d val is %d\n",it,p[it]);
            if(p[it] < 0) {
                int k = get_pos_sum(it,p[it]);
  //              printf("neg case,k is %d\n",k);
                if(k <= n) {
                    update_val(1,0,n,k,(query_sum(1,0,n,it,k) + p[it]) - get_val(1,0,n,k));
                }
                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) {
     //       printf("col trans %d %d\n",pref_col[j] + 1,q[j]);
            update_val(1,0,n,0,q[j]);
            int k = get_pos_sum(pref_col[j] + 1,-q[j]);
            if(k <= n) {
                update_val(1,0,n,k,(query_sum(1,0,n,pref_col[j] + 1,k) - q[j]) - get_val(1,0,n,k));
            }
            if(pref_col[j] + 1 <= k - 1) {
                update_0(1,0,n,pref_col[j] + 1,k - 1);
            }
        }
//        long long tmp = 0;afis(1,0,n,tmp);printf("\n");
    }

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

    return 0;
}

Compilation message

dishes.cpp: In function 'int i32()':
dishes.cpp:249: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:257: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:265: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: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);
             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 55236 KB Output is correct
2 Correct 567 ms 68620 KB Output is correct
3 Correct 257 ms 65772 KB Output is correct
4 Correct 401 ms 68552 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 547 ms 67336 KB Output is correct
7 Correct 124 ms 53740 KB Output is correct
8 Correct 52 ms 36344 KB Output is correct
9 Correct 254 ms 66852 KB Output is correct
10 Correct 636 ms 64888 KB Output is correct
11 Correct 248 ms 60268 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 25 ms 23932 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23892 KB Output is correct
13 Correct 24 ms 24056 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 25 ms 24184 KB Output is correct
18 Correct 26 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 26 ms 24184 KB Output is correct
21 Correct 30 ms 24184 KB Output is correct
22 Correct 29 ms 24116 KB Output is correct
23 Correct 28 ms 24312 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 25 ms 23932 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23892 KB Output is correct
13 Correct 24 ms 24056 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 25 ms 24184 KB Output is correct
18 Correct 26 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 26 ms 24184 KB Output is correct
21 Correct 30 ms 24184 KB Output is correct
22 Correct 29 ms 24116 KB Output is correct
23 Correct 28 ms 24312 KB Output is correct
24 Correct 356 ms 62424 KB Output is correct
25 Correct 373 ms 63120 KB Output is correct
26 Correct 327 ms 62576 KB Output is correct
27 Correct 370 ms 68216 KB Output is correct
28 Correct 490 ms 64072 KB Output is correct
29 Correct 248 ms 63728 KB Output is correct
30 Correct 1075 ms 65936 KB Output is correct
31 Correct 193 ms 52020 KB Output is correct
32 Correct 50 ms 34552 KB Output is correct
33 Correct 622 ms 64120 KB Output is correct
34 Correct 868 ms 64312 KB Output is correct
35 Correct 1136 ms 59536 KB Output is correct
36 Correct 1088 ms 59472 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 25 ms 23932 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23892 KB Output is correct
13 Correct 24 ms 24056 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 25 ms 24184 KB Output is correct
18 Correct 26 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 26 ms 24184 KB Output is correct
21 Correct 30 ms 24184 KB Output is correct
22 Correct 29 ms 24116 KB Output is correct
23 Correct 28 ms 24312 KB Output is correct
24 Correct 356 ms 62424 KB Output is correct
25 Correct 373 ms 63120 KB Output is correct
26 Correct 327 ms 62576 KB Output is correct
27 Correct 370 ms 68216 KB Output is correct
28 Correct 490 ms 64072 KB Output is correct
29 Correct 248 ms 63728 KB Output is correct
30 Correct 1075 ms 65936 KB Output is correct
31 Correct 193 ms 52020 KB Output is correct
32 Correct 50 ms 34552 KB Output is correct
33 Correct 622 ms 64120 KB Output is correct
34 Correct 868 ms 64312 KB Output is correct
35 Correct 1136 ms 59536 KB Output is correct
36 Correct 1088 ms 59472 KB Output is correct
37 Correct 331 ms 65524 KB Output is correct
38 Correct 371 ms 71228 KB Output is correct
39 Correct 575 ms 68472 KB Output is correct
40 Correct 744 ms 68604 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1132 ms 69124 KB Output is correct
43 Correct 709 ms 66936 KB Output is correct
44 Correct 779 ms 67316 KB Output is correct
45 Correct 1144 ms 62604 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23800 KB Output is correct
8 Correct 25 ms 23932 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23892 KB Output is correct
13 Correct 24 ms 24056 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 25 ms 24184 KB Output is correct
18 Correct 26 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 26 ms 24184 KB Output is correct
21 Correct 30 ms 24184 KB Output is correct
22 Correct 29 ms 24116 KB Output is correct
23 Correct 28 ms 24312 KB Output is correct
24 Correct 356 ms 62424 KB Output is correct
25 Correct 373 ms 63120 KB Output is correct
26 Correct 327 ms 62576 KB Output is correct
27 Correct 370 ms 68216 KB Output is correct
28 Correct 490 ms 64072 KB Output is correct
29 Correct 248 ms 63728 KB Output is correct
30 Correct 1075 ms 65936 KB Output is correct
31 Correct 193 ms 52020 KB Output is correct
32 Correct 50 ms 34552 KB Output is correct
33 Correct 622 ms 64120 KB Output is correct
34 Correct 868 ms 64312 KB Output is correct
35 Correct 1136 ms 59536 KB Output is correct
36 Correct 1088 ms 59472 KB Output is correct
37 Correct 331 ms 65524 KB Output is correct
38 Correct 371 ms 71228 KB Output is correct
39 Correct 575 ms 68472 KB Output is correct
40 Correct 744 ms 68604 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1132 ms 69124 KB Output is correct
43 Correct 709 ms 66936 KB Output is correct
44 Correct 779 ms 67316 KB Output is correct
45 Correct 1144 ms 62604 KB Output is correct
46 Correct 1688 ms 148420 KB Output is correct
47 Correct 2053 ms 177604 KB Output is correct
48 Correct 3151 ms 176876 KB Output is correct
49 Correct 4045 ms 176844 KB Output is correct
50 Correct 7525 ms 165716 KB Output is correct
51 Correct 3979 ms 155856 KB Output is correct
52 Correct 4487 ms 155336 KB Output is correct
53 Correct 7376 ms 164484 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 55236 KB Output is correct
2 Correct 567 ms 68620 KB Output is correct
3 Correct 257 ms 65772 KB Output is correct
4 Correct 401 ms 68552 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 547 ms 67336 KB Output is correct
7 Correct 124 ms 53740 KB Output is correct
8 Correct 52 ms 36344 KB Output is correct
9 Correct 254 ms 66852 KB Output is correct
10 Correct 636 ms 64888 KB Output is correct
11 Correct 248 ms 60268 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 25 ms 23800 KB Output is correct
16 Correct 24 ms 23800 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23800 KB Output is correct
19 Correct 25 ms 23932 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23892 KB Output is correct
24 Correct 24 ms 24056 KB Output is correct
25 Correct 23 ms 23928 KB Output is correct
26 Correct 23 ms 23928 KB Output is correct
27 Correct 23 ms 23928 KB Output is correct
28 Correct 25 ms 24184 KB Output is correct
29 Correct 26 ms 24184 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 26 ms 24184 KB Output is correct
32 Correct 30 ms 24184 KB Output is correct
33 Correct 29 ms 24116 KB Output is correct
34 Correct 28 ms 24312 KB Output is correct
35 Correct 356 ms 62424 KB Output is correct
36 Correct 373 ms 63120 KB Output is correct
37 Correct 327 ms 62576 KB Output is correct
38 Correct 370 ms 68216 KB Output is correct
39 Correct 490 ms 64072 KB Output is correct
40 Correct 248 ms 63728 KB Output is correct
41 Correct 1075 ms 65936 KB Output is correct
42 Correct 193 ms 52020 KB Output is correct
43 Correct 50 ms 34552 KB Output is correct
44 Correct 622 ms 64120 KB Output is correct
45 Correct 868 ms 64312 KB Output is correct
46 Correct 1136 ms 59536 KB Output is correct
47 Correct 1088 ms 59472 KB Output is correct
48 Correct 331 ms 65524 KB Output is correct
49 Correct 371 ms 71228 KB Output is correct
50 Correct 575 ms 68472 KB Output is correct
51 Correct 744 ms 68604 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1132 ms 69124 KB Output is correct
54 Correct 709 ms 66936 KB Output is correct
55 Correct 779 ms 67316 KB Output is correct
56 Correct 1144 ms 62604 KB Output is correct
57 Correct 490 ms 66212 KB Output is correct
58 Correct 405 ms 71908 KB Output is correct
59 Incorrect 1026 ms 69564 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 55236 KB Output is correct
2 Correct 567 ms 68620 KB Output is correct
3 Correct 257 ms 65772 KB Output is correct
4 Correct 401 ms 68552 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 547 ms 67336 KB Output is correct
7 Correct 124 ms 53740 KB Output is correct
8 Correct 52 ms 36344 KB Output is correct
9 Correct 254 ms 66852 KB Output is correct
10 Correct 636 ms 64888 KB Output is correct
11 Correct 248 ms 60268 KB Output is correct
12 Correct 24 ms 23800 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 25 ms 23800 KB Output is correct
16 Correct 24 ms 23800 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23800 KB Output is correct
19 Correct 25 ms 23932 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23892 KB Output is correct
24 Correct 24 ms 24056 KB Output is correct
25 Correct 23 ms 23928 KB Output is correct
26 Correct 23 ms 23928 KB Output is correct
27 Correct 23 ms 23928 KB Output is correct
28 Correct 25 ms 24184 KB Output is correct
29 Correct 26 ms 24184 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 26 ms 24184 KB Output is correct
32 Correct 30 ms 24184 KB Output is correct
33 Correct 29 ms 24116 KB Output is correct
34 Correct 28 ms 24312 KB Output is correct
35 Correct 356 ms 62424 KB Output is correct
36 Correct 373 ms 63120 KB Output is correct
37 Correct 327 ms 62576 KB Output is correct
38 Correct 370 ms 68216 KB Output is correct
39 Correct 490 ms 64072 KB Output is correct
40 Correct 248 ms 63728 KB Output is correct
41 Correct 1075 ms 65936 KB Output is correct
42 Correct 193 ms 52020 KB Output is correct
43 Correct 50 ms 34552 KB Output is correct
44 Correct 622 ms 64120 KB Output is correct
45 Correct 868 ms 64312 KB Output is correct
46 Correct 1136 ms 59536 KB Output is correct
47 Correct 1088 ms 59472 KB Output is correct
48 Correct 331 ms 65524 KB Output is correct
49 Correct 371 ms 71228 KB Output is correct
50 Correct 575 ms 68472 KB Output is correct
51 Correct 744 ms 68604 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1132 ms 69124 KB Output is correct
54 Correct 709 ms 66936 KB Output is correct
55 Correct 779 ms 67316 KB Output is correct
56 Correct 1144 ms 62604 KB Output is correct
57 Correct 1688 ms 148420 KB Output is correct
58 Correct 2053 ms 177604 KB Output is correct
59 Correct 3151 ms 176876 KB Output is correct
60 Correct 4045 ms 176844 KB Output is correct
61 Correct 7525 ms 165716 KB Output is correct
62 Correct 3979 ms 155856 KB Output is correct
63 Correct 4487 ms 155336 KB Output is correct
64 Correct 7376 ms 164484 KB Output is correct
65 Correct 490 ms 66212 KB Output is correct
66 Correct 405 ms 71908 KB Output is correct
67 Incorrect 1026 ms 69564 KB Output isn't correct
68 Halted 0 ms 0 KB -