oj.uz

답안 #155650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155650 2019-09-29T14:49:41 Z HellAngel 수열 (APIO14_sequence) C++14
33 / 100
 162 ms 131076 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 7;

int n, k, dp[207][maxn], a[maxn], m, prv[207][maxn];

void Solve(int x)
{
    int cur = x - 1;
    for(int i = x; i <= n; i++)
    {
        while(cur + 1 < i && dp[x - 1][cur] + (a[i] - a[cur]) * a[cur] <= dp[x - 1][cur + 1] + (a[i] - a[cur + 1]) * a[cur + 1])
        {
            cur++;
        }
        dp[x][i] = dp[x - 1][cur] + (a[i] - a[cur]) * a[cur];
        prv[x][i] = cur;
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin), freopen("test.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] += a[i - 1];
    }
    for(int j = 2; j <= m + 1; j++)
    {
        Solve(j);
    }
    cout << dp[m + 1][n] << '\n';
    vector<int> ans;
    for(int i = m; i >= 1; i--)
    {
        ans.push_back(prv[i + 1][n]);
        n = prv[i + 1][n];
    }
    sort(ans.begin(), ans.end());
    for(auto i: ans) cout << i << ' ';
}

Compilation message

sequence.cpp: In function 'int32_t main()':
sequence.cpp:26:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin), freopen("test.out", "w", stdout);
                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:26:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 376 KB contestant found the optimal answer: 0 == 0
4 Correct 3 ms 504 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 504 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 504 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 380 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 888 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 504 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 3 ms 636 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 504 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 3 ms 504 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 384 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 4 ms 2820 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 2232 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 2600 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 ms 2808 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 888 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 732 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 1144 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 5368 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 5368 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 7 ms 4728 KB contestant didn't find the optimal answer: 4698976842 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 888 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 1016 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 43 ms 33656 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 1016 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 35 ms 20344 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 37 ms 23708 KB contestant didn't find the optimal answer: 514785562499 < 514790755404
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 5888 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 16 ms 6008 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 162 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -