oj.uz

답안 #1086529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086529 2024-09-11T01:40:12 Z User0069 수열 (APIO14_sequence) C++17
71 / 100
 50 ms 131072 KB 
#include<bits/stdc++.h>
#define taskname ""
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define int long long
using namespace std;
#define Faster ios_base::sync_with_stdio(false);cin.tie(0);
const int maxn=1e5+33;
const int N=1e5;
const int mod=1e9+7;
const long long INF=1e18+2;
int n,k,a[maxn],dp[maxn][2],trace[maxn][202];
struct line
{
   int a,b,i;
};
vector<line> cht;
vector<long double> point;
long double intersect(line x,line y)
{
    return 1.0*(y.b-x.b)/(x.a-y.a);
}
void pop()
{
    cht.pop_back(),point.pop_back();
}
void add(line x)
{
    while(cht.size()&&cht.back().a==x.a) pop();
    while(cht.size()>1&&intersect(x,cht.back())<=point.back()) pop();
    if(cht.size()) point.push_back(intersect(x,cht.back()));
    else point.push_back(-INF);
    cht.push_back(x);
}
signed main()
{
    if (fopen(taskname".INP","r"))
    {
        freopen(taskname".INP","r",stdin);
        freopen(taskname".OUT","w",stdout);
    }
    Faster
    cin>>n>>k;
    k++;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }
    for(int i=2;i<=k;i++)
    {
        cht.clear();
        point.clear();
        add({a[i-1],dp[i-1][1-(i&1)]-a[i-1]*a[i-1],i-1});
        int ii=0;
        for(int j=i;j<=n;j++)
        {
            while(ii+1<cht.size()&&point[ii+1]<a[j]) ii++;
            dp[j][i&1]=cht[ii].a*a[j]+cht[ii].b;
            trace[j][i]=cht[ii].i;
            add({a[j],dp[j][1-(i&1)]-a[j]*a[j],j});
        }
    }
    cout<<dp[n][k&1]<<"\n";
    int siu=n;
    for(int i=k;i>1;i--)
    {
        cout<<trace[siu][i]<<" ";
        siu=trace[siu][i];
    }
//    cout<<"\n";
//    for(int i=1;i<=n;i++)
//    {
//        for(int j=1;j<=k;j++)
//        {
//            cout<<dp[i][j]<<" ";
//        }
//        cout<<"\n";
//    }

}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:61:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             while(ii+1<cht.size()&&point[ii+1]<a[j]) ii++;
      |                   ~~~~^~~~~~~~~~~
sequence.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(taskname".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(taskname".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16940 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 17012 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 47 ms 16872 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 16872 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 42 ms 16944 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 43 ms 16944 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 48 ms 16876 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 34 ms 16872 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 38 ms 16876 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 47 ms 16876 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 50 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -