oj.uz

Submission #1023199

# Submission time Handle Problem Language Result Execution time Memory
1023199 2024-07-14T13:02:11 Z daffuwu Split the sequence (APIO14_sequence) C++14
0 / 100
 469 ms 82468 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, opt[100002][202], ps[100069];
const double eps = 1e-18;
vector<int> vc;
long long dp[100069][2];

bool lessThan(double a, double b)
{
    return b-a>eps;
}

bool mantap(long long c1, int m1, long long c2, int m2, long long c3, int m3)
{
    return (m2 != m3) && 1ll*(c1-c2)*1ll*(m3-m2)<1ll*(c2-c3)*1ll*(m2-m1);
}

long long calc(int id1, int id2, int c)
{
    return dp[id1][c%2]+1ll*(ps[id2]-ps[id1])*ps[id1];
}

long long calc_c(int id, int c)
{
    return dp[id][c%2]-1ll*ps[id]*ps[id];
}

int main() 
{
    int i, j, c;
    scanf("%d%d", &n, &k);
    k++;
    for (i=1; i<=n; i++)
    {
        scanf("%d", ps+i);
        ps[i] += ps[i-1];
        dp[i][0] = -1e15;
    }
    for (c=1; c<=k; c++)
    {
        dp[0][c%2] = -1e15;
        for (i=1, j=0; i<=n; i++)
        {
            vc.push_back(i-1);
            for (; j+1<vc.size() && calc(vc[j], i, c-1)<calc(vc[j+1], i, c-1); j++);
            j = min(j, (int)vc.size()-1);
            opt[i][c] = vc[j];
            dp[i][c%2] = calc(vc[j], i, c-1);
            for (; vc.size()>=2 && !mantap(calc_c(vc.size()-2, c-1), ps[vc.size()-2], calc_c(vc.back(), c-1), ps[vc.back()], calc_c(i, c-1), ps[i]); vc.pop_back());
        }
    }
    printf("%lld\n", dp[n][k%2]);
    for (i=n, c=k; c>=2; i=opt[i][c], c--)
    {
        printf("%d ", opt[i][c]);
    }
    printf("\n");
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             for (; j+1<vc.size() && calc(vc[j], i, c-1)<calc(vc[j+1], i, c-1); j++);
      |                    ~~~^~~~~~~~~~
sequence.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf("%d%d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         scanf("%d", ps+i);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 344 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 348 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 344 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 344 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 344 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 348 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 348 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 344 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Incorrect 0 ms 348 KB Integer 0 violates the range [1, 9]
16 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 348 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 348 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 388 KB contestant found the optimal answer: 933702 == 933702
7 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 19482895015 < 25082842857
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 604 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 1112 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 604 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 712 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 600 KB position 100 occurs twice in split scheme
7 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1116 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 1864 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1116 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 7 ms 1752 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 4 ms 1748 KB contestant didn't find the optimal answer: 4697131984 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 8796 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 44 ms 9124 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 8536 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 31 ms 9176 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 34 ms 9176 KB contestant didn't find the optimal answer: 514785503034 < 514790755404
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 81872 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 45 ms 82128 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Incorrect 469 ms 82468 KB contestant didn't find the optimal answer: 497214931709564185 < 497313449256899208
4 Halted 0 ms 0 KB -