oj.uz

답안 #23462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23462 2017-05-09T17:32:44 Z rubabredwan 수열 (APIO14_sequence) C++14
71 / 100
 89 ms 18492 KB 
/* Bismillahir Rahmanir Rahim */
 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 10005;
const int K = 205;
 
vector<long long>M, B;
int ptr;
 
bool bad(int a, int b, int c){
    return (B[a] - B[b]) * (M[c] - M[a]) >= (B[a] - B[c]) * (M[b] - M[a]);
}
 
void add(long long m, long long b){
    M.push_back(m);
    B.push_back(b);
    while(M.size() >= 3 && bad(M.size()-3, M.size()-2, M.size()-1)){
        M.erase(M.end()-2);
        B.erase(B.end()-2);
    }
}
 
long long query(long long x){
    if(ptr >= M.size()) ptr = M.size() - 1;
    while(ptr + 1 < M.size() && M[ptr+1] * x + B[ptr+1] > M[ptr] * x + B[ptr]){
        ++ptr;
    }
    return M[ptr] * x + B[ptr];
}
 
long long dp[N][K], A[N], sum[N];
int n, k;
 
int main(){
    scanf("%d %d", &n, &k);
    for(int i=1;i<=n;i++){
        scanf("%lld", &A[i]);
        sum[i] = sum[i-1] + A[i];
    }
    for(int j=1;j<=k;j++){
        M.clear();
        B.clear();
        ptr = 0;
        add(sum[1], -(sum[1] * sum[1]));
        for(int i=2;i<=n;i++){
            dp[i][j] = query(sum[i]);
            add(sum[i], -(sum[i] * sum[i]) + dp[i][j-1]);
        }
    }
    cout << dp[n][k] << endl;
    while(k){
        for(int div = n-1;div >= 1;div--){
            long long add = sum[div] * sum[n] - sum[div] * sum[div];
            if(dp[div][k-1] + add == dp[n][k]){
                cout << div << ' ';
                n = div;
                break;
            }
        }
        k--;
    }
    cout << endl;
	return 0;
}

Compilation message

sequence.cpp: In function 'long long int query(long long int)':
sequence.cpp:27:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(ptr >= M.size()) ptr = M.size() - 1;
            ^
sequence.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ptr + 1 < M.size() && M[ptr+1] * x + B[ptr+1] > M[ptr] * x + B[ptr]){
                   ^
sequence.cpp: In function 'int main()':
sequence.cpp:38:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
                           ^
sequence.cpp:40:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &A[i]);
                             ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 18200 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 18200 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 18200 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 18200 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 18200 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 18200 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 18200 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 18200 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 18200 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 18200 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 18200 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 18200 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 18200 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 18200 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 18200 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 18200 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 18200 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 18200 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 18200 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 18200 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 18200 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 18200 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 18200 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 18200 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 18200 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 18200 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 18200 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 18200 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 18200 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 3 ms 18200 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 18200 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 9 ms 18200 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 6 ms 18200 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 3 ms 18200 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 3 ms 18200 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 18200 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 18200 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 18360 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 18360 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 83 ms 18492 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 18492 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 66 ms 18360 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 73 ms 18360 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 69 ms 18492 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 53 ms 18492 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 69 ms 18492 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 89 ms 18492 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 18360 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -