oj.uz

답안 #169066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
169066 2019-12-18T08:43:48 Z Akashi Cake 3 (JOI19_cake3) C++14
100 / 100
 1768 ms 16632 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

struct cake{
    int pv, v, c, p;
    bool operator < (const cake &aux)const{
        if(c != aux.c) return c < aux.c;
        return v < aux.v;
    }
};
cake a[200005], v[200005];
bool cmp(cake x, cake y){
    if(x.v != y.v) return x.v < y.v;
    if(x.c != y.c) return x.c < y.c;
    return x.p < y.p;
}

int n, m;
long long Arb[800005];
int cnt[800005];

void update(int p, int v, int st = 1, int dr = n, int nod = 1){
    if(st == dr){
        Arb[nod] += v;
        if(v > 0) ++cnt[nod];
        else --cnt[nod];
        return ;
    }

    int mij = (st + dr) / 2;
    if(p <= mij) update(p, v, st, mij, nod * 2);
    else update(p, v, mij + 1, dr, nod * 2 + 1);

    Arb[nod] = Arb[nod * 2] + Arb[nod * 2 + 1];
    cnt[nod] = cnt[nod * 2] + cnt[nod * 2 + 1];
}

long long query(int k, int st = 1, int dr = n, int nod = 1){
    if(k == 0) return 0;
    if(cnt[nod] <= k) return Arb[nod];

    int mij = (st + dr) / 2;
    if(cnt[nod * 2 + 1] >= k) return query(k, mij + 1, dr, nod * 2 + 1);

    return Arb[nod * 2 + 1] + query(k - cnt[nod * 2 + 1], st, mij, nod * 2);
}

int l = 1, r;
long long calc(int st, int dr){
    if(st > dr) return -INF;

    while(r < dr) ++r, update(a[r].pv, a[r].v);
    while(l > st) --l, update(a[l].pv, a[l].v);
    while(l < st) update(a[l].pv, -a[l].v), ++l;
    while(r > dr) update(a[r].pv, -a[r].v), --r;

    if(dr - st + 1 < m - 2) return -INF;
    return query(m - 2);
}

long long ans = -INF;
void solve(int st, int dr, int down, int up){
    if(st > dr) return ;

    int mij = (st + dr) / 2;

    long long sol = -INF, best = 0;

    for(int i = max(down, mij + m - 1); i <= up ; ++i){
        long long val = calc(mij + 1, i - 1) - (a[i].c - a[mij].c) + a[i].v + a[mij].v;
        if(val > sol){
            sol = val;
            best = i;
        }
    }

    ans = max(ans, sol);
    if(st == dr) return ;

    solve(mij + 1, dr, best, up);
    solve(st, mij - 1, down, best);
}

int main()
{
//    freopen("1.in", "r", stdin);

    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n ; ++i){
        scanf("%d%d", &a[i].v, &a[i].c);
        a[i].c *= 2; a[i].p = i;
        v[i] = a[i];
    }

    sort(a + 1, a + n + 1);
    sort(v + 1, v + n + 1, cmp);

    for(int i = 1; i <= n ; ++i){
        int st = 1, dr = n;
        while(st <= dr){
            int mij = (st + dr) / 2;
            if(v[mij].v < a[i].v || (v[mij].v == a[i].v && v[mij].c < a[i].c) || ((v[mij].v == a[i].v && v[mij].c == a[i].c && v[mij].p <= a[i].p))) st = mij + 1;
            else dr = mij - 1;
        }
        a[i].pv = dr;
    }

    solve(1, n - m + 1, m, n);
    printf("%lld", ans);

    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
cake3.cpp:92:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i].v, &a[i].c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 532 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 6 ms 504 KB Output is correct
42 Correct 4 ms 504 KB Output is correct
43 Correct 5 ms 552 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 504 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 8 ms 504 KB Output is correct
48 Correct 7 ms 504 KB Output is correct
49 Correct 6 ms 504 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 6 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 6 ms 504 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 504 KB Output is correct
58 Correct 4 ms 504 KB Output is correct
59 Correct 5 ms 504 KB Output is correct
60 Correct 6 ms 504 KB Output is correct
61 Correct 5 ms 504 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 5 ms 504 KB Output is correct
64 Correct 5 ms 504 KB Output is correct
65 Correct 7 ms 504 KB Output is correct
66 Correct 6 ms 632 KB Output is correct
67 Correct 7 ms 504 KB Output is correct
68 Correct 6 ms 504 KB Output is correct
69 Correct 6 ms 504 KB Output is correct
70 Correct 6 ms 504 KB Output is correct
71 Correct 6 ms 504 KB Output is correct
72 Correct 4 ms 504 KB Output is correct
73 Correct 6 ms 504 KB Output is correct
74 Correct 4 ms 632 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 532 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 6 ms 504 KB Output is correct
42 Correct 4 ms 504 KB Output is correct
43 Correct 5 ms 552 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 504 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 8 ms 504 KB Output is correct
48 Correct 7 ms 504 KB Output is correct
49 Correct 6 ms 504 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 6 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 6 ms 504 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 504 KB Output is correct
58 Correct 4 ms 504 KB Output is correct
59 Correct 5 ms 504 KB Output is correct
60 Correct 6 ms 504 KB Output is correct
61 Correct 5 ms 504 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 5 ms 504 KB Output is correct
64 Correct 5 ms 504 KB Output is correct
65 Correct 7 ms 504 KB Output is correct
66 Correct 6 ms 632 KB Output is correct
67 Correct 7 ms 504 KB Output is correct
68 Correct 6 ms 504 KB Output is correct
69 Correct 6 ms 504 KB Output is correct
70 Correct 6 ms 504 KB Output is correct
71 Correct 6 ms 504 KB Output is correct
72 Correct 4 ms 504 KB Output is correct
73 Correct 6 ms 504 KB Output is correct
74 Correct 4 ms 632 KB Output is correct
75 Correct 1398 ms 15972 KB Output is correct
76 Correct 1668 ms 15736 KB Output is correct
77 Correct 1221 ms 16120 KB Output is correct
78 Correct 1375 ms 16120 KB Output is correct
79 Correct 212 ms 16248 KB Output is correct
80 Correct 316 ms 15992 KB Output is correct
81 Correct 1413 ms 15324 KB Output is correct
82 Correct 1768 ms 15572 KB Output is correct
83 Correct 1625 ms 15736 KB Output is correct
84 Correct 1678 ms 15744 KB Output is correct
85 Correct 1434 ms 15452 KB Output is correct
86 Correct 766 ms 14968 KB Output is correct
87 Correct 835 ms 14968 KB Output is correct
88 Correct 1246 ms 15076 KB Output is correct
89 Correct 1177 ms 15352 KB Output is correct
90 Correct 804 ms 15848 KB Output is correct
91 Correct 519 ms 14968 KB Output is correct
92 Correct 534 ms 15048 KB Output is correct
93 Correct 636 ms 15380 KB Output is correct
94 Correct 453 ms 15736 KB Output is correct
95 Correct 766 ms 15776 KB Output is correct
96 Correct 684 ms 15152 KB Output is correct
97 Correct 729 ms 15728 KB Output is correct
98 Correct 755 ms 15608 KB Output is correct
99 Correct 708 ms 15740 KB Output is correct
100 Correct 559 ms 15224 KB Output is correct
101 Correct 583 ms 15224 KB Output is correct
102 Correct 1256 ms 15100 KB Output is correct
103 Correct 1181 ms 15012 KB Output is correct
104 Correct 1383 ms 15480 KB Output is correct
105 Correct 1056 ms 15352 KB Output is correct
106 Correct 1028 ms 15736 KB Output is correct
107 Correct 884 ms 15324 KB Output is correct
108 Correct 1185 ms 15924 KB Output is correct
109 Correct 928 ms 16504 KB Output is correct
110 Correct 566 ms 14520 KB Output is correct
111 Correct 807 ms 14788 KB Output is correct
112 Correct 866 ms 14416 KB Output is correct
113 Correct 220 ms 16632 KB Output is correct