oj.uz

Submission #154783

# Submission time Handle Problem Language Result Execution time Memory
154783 2019-09-24T15:19:56 Z Mercenary Split the sequence (APIO14_sequence) C++14
71 / 100
 2000 ms 83420 KB 
#include<bits/stdc++.h>
#define pb push_back
#define brokenheart "TEST"
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5 + 5;
 
struct TVector{
    int x;
    ll y;
    TVector operator - (const TVector & other)
    {
        return {other.x - x , other.y - y};
    }
    bool operator % (const TVector & other)
    {
        return (ld)x * other.y <= (ld)other.x * y;
    }
    ll operator * (const ll & other)
    {
        return x * other + y;
    }
    bool operator < (const TVector & other)
    {
        if(x != other.x)return x < other.x;
        return y < other.y;
    }
};
int n , m , k , trace[maxn][201] , b[maxn] , sum[maxn];
ll dp[maxn][2];
TVector a[maxn];
 
void add(TVector now , int j)
{
    while(m >= 2 && (a[m] - a[m - 1]) % (a[m] - now))--m;
    a[++m] = now;
    b[m] = j;
}
 
ll ans(TVector now , ll k)
{
    return now.x * k + now.y;
}
 
void enter()
{
    cin >> n >> k;
    for(int i = 1 ; i <= n ; ++i)
    {
        cin >> sum[i];
        sum[i] += sum[i - 1];
    }
    bool bit = 0;
    for(int i = 1 ; i <= k ; ++i)
    {
        bit ^= 1;
        m = 0;
        int p = 1;
        for(int j = i + 1 ; j <= n ; ++j)
        {
            add({sum[j - 1] , dp[j - 1][bit ^ 1] - (ll)sum[j - 1] * sum[j - 1]} , j - 1);
            p = min(p , m);
            while(p < m && ans(a[p] , sum[j]) < ans(a[p + 1] , sum[j]))
                ++p;
            dp[j][bit] = ans(a[p] , sum[j]);
            trace[j][i] = b[p];
        }
    }
 
    cout << dp[n][bit] << '\n';
    int best = n;
    for(int i = k ; i >= 1 ; --i)
    {
        assert(best);
        best = trace[best][i];
        cout << best << " ";
    }
}
 
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
    if(fopen(brokenheart".INP","r"))
        freopen(brokenheart".INP","r",stdin) ,
        freopen(brokenheart".OUT","w",stdout);
    enter();
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:86:46: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(brokenheart".INP","r",stdin) ,
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
         freopen(brokenheart".OUT","w",stdout);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
sequence.cpp:86:46: 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 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 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 3 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 3 ms 376 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 376 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 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 376 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 3 ms 380 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 376 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 376 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 380 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 508 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 508 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 508 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 504 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 504 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 504 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 504 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 504 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 504 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1400 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 1144 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 1144 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 1148 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 1144 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1148 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1144 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 1144 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 1144 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1144 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8568 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 8568 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 91 ms 8736 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 13 ms 8696 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 55 ms 8440 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 71 ms 8568 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 63 ms 8716 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 53 ms 8696 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 64 ms 8684 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 76 ms 8684 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 82680 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 100 ms 82816 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2051 ms 83420 KB Time limit exceeded
4 Halted 0 ms 0 KB -