oj.uz

Submission #331028

# Submission time Handle Problem Language Result Execution time Memory
331028 2020-11-27T04:44:17 Z leinad2 Split the sequence (APIO14_sequence) C++14
100 / 100
 868 ms 92764 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, i, j, k, t, a, A[100010], dp[100010][2], chk[100010];
struct line
{
    ll a, b, index;
};
vector<line>V;
double cross(const line &p, const line &q)
{
    return (double)(q.b-p.b)/(p.a-q.a);
}
void push(line x)
{
    if(V.size()&&V.back().a==x.a)
    {
        if(V.back().b<x.b)V.back().b=x.b;
        return;
    }
    while(V.size()>=2)
    {
        if(cross(V.back(), V[V.size()-2])>cross(V.back(), x))V.pop_back();
        else break;
    }
    V.push_back(x);
}
pair<ll, ll>query(ll x)
{
    if(V.size()<=a)a=V.size()-1;
    else while(a+1<V.size()&&cross(V[a+1], V[a])<=x)a++;
    return {V[a].a*x+V[a].b, V[a].index};
}
int backtrack[100010][210];
int main()
{
    for(scanf("%lld %lld", &n, &k);i++<n;)
    {
        scanf("%lld", &A[i]);
        A[i]+=A[i-1];
    }
    for(j=0;j++<k;)
    {
        for(a=i=0;i++<n;)
        {
            push({A[i], dp[i][0]-A[i]*A[i], i});
            pair<ll, ll>p=query(A[i]);
            dp[i][1]=p.first;
            backtrack[i][j]=p.second;
            dp[i][0]=dp[i][1];
        }
        V.clear();
    }
    printf("%lld\n", dp[n][1]);
    i=n;
    j=k;
    vector<int>ans;
    while(j>0)
    {
        i=backtrack[i][j];
        j--;
        ans.push_back(i);
    }
    set<int>s;
    for(i=0;++i<n;)s.insert(i);
    while(ans.size())
    {
        if(ans.back()>=n)
        {
            ans.back()=*s.begin();
        }
        printf("%d ", ans.back());
        chk[ans.back()]=1;
        s.erase(ans.back());
        ans.pop_back();
    }
}

Compilation message

sequence.cpp: In function 'std::pair<long long int, long long int> query(ll)':
sequence.cpp:30:16: warning: comparison of integer expressions of different signedness: 'std::vector<line>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   30 |     if(V.size()<=a)a=V.size()-1;
      |        ~~~~~~~~^~~
sequence.cpp:31:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     else while(a+1<V.size()&&cross(V[a+1], V[a])<=x)a++;
      |                ~~~^~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     for(scanf("%lld %lld", &n, &k);i++<n;)
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |         scanf("%lld", &A[i]);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 364 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 364 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 364 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 364 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 364 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 364 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 364 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 364 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 364 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 364 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 364 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 364 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 364 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 364 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 364 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 512 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 364 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 364 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 364 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 364 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 364 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 364 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 492 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 640 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 492 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 492 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 492 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 492 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 492 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 492 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 492 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1260 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1260 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 8 ms 1260 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1388 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 1260 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1260 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 1260 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 8 ms 1260 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1260 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1260 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9516 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 9516 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 72 ms 9576 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 9 ms 9448 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 51 ms 9516 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 53 ms 9644 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 66 ms 9576 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 51 ms 9576 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 53 ms 9576 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 65 ms 9572 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 91484 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 86 ms 91484 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 853 ms 92764 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 89 ms 91996 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 868 ms 92252 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 608 ms 92124 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 736 ms 92636 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 567 ms 92380 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 585 ms 92292 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 737 ms 92380 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845