oj.uz

답안 #1023215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023215 2024-07-14T13:19:53 Z daffuwu 수열 (APIO14_sequence) C++14
22 / 100
 331 ms 82332 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];
vector<int> vc;
long long dp[100069][2];
 
bool mantap(long long c1, int m1, long long c2, int m2, long long c3, int m3)
{
    return (m2 != m3) && 1.0*(c1-c2)/(m2-m1)<1.0*(c2-c3)/(m3-m2);
}
 
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:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |             for (; j+1<vc.size() && calc(vc[j], i, c-1)<calc(vc[j+1], i, c-1); j++);
      |                    ~~~^~~~~~~~~~
sequence.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%d%d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         scanf("%d", ps+i);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 344 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 348 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 348 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 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 348 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 348 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 348 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 348 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 456 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 348 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 496 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 348 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 344 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 608 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 604 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 604 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 604 KB position 1 occurs twice in split scheme
7 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 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 1120 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1120 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 5 ms 1116 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 4 ms 1116 KB contestant didn't find the optimal answer: 4699008024 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 8540 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 30 ms 8676 KB position 66 occurs twice in split scheme
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 81868 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 49 ms 82136 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Incorrect 331 ms 82332 KB position 3162 occurs twice in split scheme
4 Halted 0 ms 0 KB -