oj.uz

Submission #50357

# Submission time Handle Problem Language Result Execution time Memory
50357 2018-06-10T18:31:50 Z duality Split the sequence (APIO14_sequence) C++11
100 / 100
 973 ms 239704 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

LLI pre[100001];
LLI dp[201][100001];
int parent[201][100001];
struct line { LLI m,b; int i; };
int bad(line a,line b,line c) {
    return (b.b-a.b)*(b.m-c.m) >= (b.b-c.b)*(b.m-a.m);
}
deque<line> H;
int main() {
    int i;
    int n,k;
    scanf("%d %d",&n,&k);
    for (i = 0; i < n; i++) scanf("%lld",&pre[i+1]),pre[i+1] += pre[i];

    int j;
    for (i = 0; i <= n; i++) dp[0][i] = pre[i]*pre[i];
    for (i = 1; i <= k; i++) {
        for (j = 0; j < n; j++) {
            line l = (line){-2*pre[j],pre[j]*pre[j]+dp[i-1][j],j};
            while ((H.size() >= 2) && bad(H[H.size()-2],H.back(),l)) H.pop_back();
            H.pb(l);
            while ((H.size() >= 2) && ((H[0].m*pre[j+1]+H[0].b) >= (H[1].m*pre[j+1]+H[1].b))) H.pop_front();
            dp[i][j+1] = H[0].m*pre[j+1]+H[0].b+pre[j+1]*pre[j+1];
            parent[i][j+1] = H[0].i;
        }
        H.clear();
    }
    printf("%lld\n",(pre[n]*pre[n]-dp[k][n])/2);
    int u = n;
    for (i = k; i >= 1; i--) printf("%d ",parent[i][u]),u = parent[i][u];
    printf("\n");

    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:70:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < n; i++) scanf("%lld",&pre[i+1]),pre[i+1] += pre[i];
                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4988 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 4988 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 80 ms 26388 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 26388 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 66 ms 26388 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 73 ms 26388 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 26388 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 62 ms 26388 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 66 ms 26388 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 127 ms 26388 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 26388 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 25 ms 26388 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 808 ms 239104 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 239104 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 973 ms 239704 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 652 ms 239704 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 678 ms 239704 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 543 ms 239704 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 617 ms 239704 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 864 ms 239704 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845