oj.uz

답안 #201896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201896 2020-02-12T17:59:15 Z MKopchev Cake 3 (JOI19_cake3) C++14
100 / 100
 3400 ms 15352 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=2e5+42;
int n,m;
pair<int/*v*/,int/*c*/> inp[nmax];
bool cmp(pair<int/*v*/,int/*c*/> a,pair<int/*v*/,int/*c*/> b)
{
    return a.second<b.second;
}

int in=0;
long long sum_in=0,sum_greatest=-1e18;

set< pair<int/*value*/,int/*position*/> > active;
set< pair<int/*value*/,int/*position*/> >::iterator it;

void to_add(int positon)
{
    pair<int/*value*/,int/*position*/> current={inp[positon].first,positon};
    in++;
    sum_in+=current.first;

    if(in<=m)
    {
        active.insert(current);
        if(in==m)
        {
            sum_greatest=sum_in;
            it=active.begin();
        }
    }
    else
    {
        if(current<(*it))//current is less than the greatest m values
        {
            active.insert(current);
        }
        else//current is greater than some of the greatest m values
        {
            sum_greatest-=(*it).first;

            active.insert(current);
            sum_greatest+=current.first;

            it++;
        }
    }
}
void to_remove(int positon)
{
    pair<int/*value*/,int/*position*/> current={inp[positon].first,positon};

    in--;
    sum_in-=current.first;
    if(in<m)sum_greatest=-1e18;

    if(in>=m)
    {
        if(current<(*it))//current is less than the greatest m values
        {
            active.erase(current);
        }
        else//current is greater than some of the greatest m values
        {
            sum_greatest-=(current).first;
            it--;

            active.erase(current);

            sum_greatest+=(*it).first;
        }
    }
    else
    {
        active.erase(current);
    }
}

long long output=-1e18;

int left_pointer=1,right_pointer=0;

void make_active(int l,int r)
{
    l++;
    r--;

    while(left_pointer>l)
    {
        left_pointer--;
        to_add(left_pointer);
    }

    while(right_pointer<r)
    {
        right_pointer++;
        to_add(right_pointer);
    }

    while(left_pointer<l)
    {
        to_remove(left_pointer);
        left_pointer++;
    }

    while(right_pointer>r)
    {
        to_remove(right_pointer);
        right_pointer--;
    }
}
void divide_and_conquer(int l,int r,int answer_left,int answer_right)
{
    if(l>r)return;

    int av=(l+r)/2;
    int best_position=answer_left;
    long long best_answer=-1e18;

    for(int j=answer_left;j<=answer_right&&j<av;j++)
    {
        make_active(j,av);

        long long current=inp[av].first+inp[j].first-2*(inp[av].second-inp[j].second);
        if(in<m)current=-1e18;
        else current+=sum_greatest;

        if(best_answer<current)
        {
            best_answer=current;
            best_position=j;
        }
        //cout<<j<<" "<<av<<" -> "<<in<<" "<<sum_in<<" "<<sum_greatest<<" "<<current<<endl;
        output=max(output,current);
    }

    divide_and_conquer(l,av-1,answer_left,best_position);
    divide_and_conquer(av+1,r,best_position,answer_right);
}
int main()
{
    scanf("%i%i",&n,&m);
    m=m-2;

    for(int i=1;i<=n;i++)scanf("%i%i",&inp[i].first,&inp[i].second);
    sort(inp+1,inp+n+1,cmp);

    it=active.begin();

    divide_and_conquer(1,n,1,n);

    printf("%lld\n",output);
    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:142:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
cake3.cpp:145:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++)scanf("%i%i",&inp[i].first,&inp[i].second);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 5 ms 256 KB Output is correct
37 Correct 5 ms 256 KB Output is correct
38 Correct 13 ms 376 KB Output is correct
39 Correct 13 ms 376 KB Output is correct
40 Correct 13 ms 376 KB Output is correct
41 Correct 12 ms 376 KB Output is correct
42 Correct 13 ms 376 KB Output is correct
43 Correct 14 ms 376 KB Output is correct
44 Correct 12 ms 376 KB Output is correct
45 Correct 13 ms 376 KB Output is correct
46 Correct 13 ms 376 KB Output is correct
47 Correct 14 ms 376 KB Output is correct
48 Correct 12 ms 376 KB Output is correct
49 Correct 13 ms 376 KB Output is correct
50 Correct 13 ms 376 KB Output is correct
51 Correct 12 ms 380 KB Output is correct
52 Correct 12 ms 376 KB Output is correct
53 Correct 12 ms 376 KB Output is correct
54 Correct 12 ms 376 KB Output is correct
55 Correct 12 ms 456 KB Output is correct
56 Correct 12 ms 380 KB Output is correct
57 Correct 14 ms 376 KB Output is correct
58 Correct 12 ms 376 KB Output is correct
59 Correct 10 ms 376 KB Output is correct
60 Correct 11 ms 376 KB Output is correct
61 Correct 10 ms 376 KB Output is correct
62 Correct 13 ms 380 KB Output is correct
63 Correct 11 ms 468 KB Output is correct
64 Correct 11 ms 376 KB Output is correct
65 Correct 12 ms 380 KB Output is correct
66 Correct 12 ms 376 KB Output is correct
67 Correct 12 ms 376 KB Output is correct
68 Correct 12 ms 380 KB Output is correct
69 Correct 14 ms 376 KB Output is correct
70 Correct 13 ms 376 KB Output is correct
71 Correct 12 ms 376 KB Output is correct
72 Correct 14 ms 376 KB Output is correct
73 Correct 12 ms 376 KB Output is correct
74 Correct 13 ms 504 KB Output is correct
75 Correct 3119 ms 10812 KB Output is correct
76 Correct 3000 ms 10896 KB Output is correct
77 Correct 3124 ms 11196 KB Output is correct
78 Correct 3195 ms 11040 KB Output is correct
79 Correct 3019 ms 11128 KB Output is correct
80 Correct 2866 ms 10936 KB Output is correct
81 Correct 2544 ms 8312 KB Output is correct
82 Correct 2431 ms 7416 KB Output is correct
83 Correct 2565 ms 8184 KB Output is correct
84 Correct 2631 ms 8312 KB Output is correct
85 Correct 2445 ms 8184 KB Output is correct
86 Correct 2577 ms 8568 KB Output is correct
87 Correct 2400 ms 8440 KB Output is correct
88 Correct 2375 ms 7928 KB Output is correct
89 Correct 2562 ms 8732 KB Output is correct
90 Correct 2821 ms 9448 KB Output is correct
91 Correct 2663 ms 9464 KB Output is correct
92 Correct 2573 ms 11604 KB Output is correct
93 Correct 2759 ms 11640 KB Output is correct
94 Correct 3049 ms 13048 KB Output is correct
95 Correct 2755 ms 11896 KB Output is correct
96 Correct 1120 ms 9976 KB Output is correct
97 Correct 1241 ms 10872 KB Output is correct
98 Correct 1196 ms 10232 KB Output is correct
99 Correct 1212 ms 11128 KB Output is correct
100 Correct 1197 ms 11116 KB Output is correct
101 Correct 1179 ms 10940 KB Output is correct
102 Correct 1548 ms 9284 KB Output is correct
103 Correct 1553 ms 9592 KB Output is correct
104 Correct 1578 ms 9336 KB Output is correct
105 Correct 1691 ms 11008 KB Output is correct
106 Correct 1741 ms 11768 KB Output is correct
107 Correct 1673 ms 11384 KB Output is correct
108 Correct 3111 ms 14252 KB Output is correct
109 Correct 3400 ms 15224 KB Output is correct
110 Correct 1544 ms 10616 KB Output is correct
111 Correct 1492 ms 8660 KB Output is correct
112 Correct 2860 ms 12340 KB Output is correct
113 Correct 3167 ms 15352 KB Output is correct