oj.uz

답안 #155652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155652 2019-09-29T14:53:12 Z HellAngel 수열 (APIO14_sequence) C++14
100 / 100
 1528 ms 82296 KB 
#include<bits/stdc++.h>
#define For(i, a, b)  for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define Task          "test"
#define ld            long double
#define ll            long long
#define X             first
#define Y             second
#define pb            push_back
//#define Karma
 
using namespace std;
 
template <typename T> inline void Cin(T &x)
{
    char c;
    T sign = 1;
    x = 0;
    for (c = getchar(); c < '0' || c > '9'; c = getchar())
        if (c == '-')
            sign = -1;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
    x *= sign;
}
 
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
const int N = 1e5 + 7;
 
int n, k;
ll a[N], f[N], _f[N];
vector<int> p[210];
 
void Enter()
{
     Cin(n), Cin(k);
     For(i, 1, n) Cin(a[i]), a[i] += a[i - 1];
}
 
void DP(int g, int l, int r, int optl, int optr)
{
     if(l > r) return;
     int mid = (l + r) / 2, lim = min(optr, mid - 1);
     f[mid] = -1;
     For(i, optl, lim)
     {
         ll newcost = _f[i] + a[i] * (a[mid] - a[i]);
         if(newcost > f[mid])
         {
             f[mid] = newcost;
             p[g][mid] = i;
         }
     }
     DP(g, l, mid - 1, optl, p[g][mid]);
     DP(g, mid + 1, r, p[g][mid], optr);
}
 
void Solve()
{
     For(i, 0, 200) p[i].resize(n + 1, 1);
     For(i, 1, k)
     {
         DP(i, 1, n, 1, n);
         For(j, 1, n) _f[j] = f[j];
     }
     cout << f[n] << '\n';
     int ptr = n;
     Ford(i, k, 1)
     {
         cout << p[i][ptr] << ' ';
         ptr = p[i][ptr];
     }
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef Karma
    freopen(Task".inp", "r", stdin);
    freopen(Task".out", "w", stdout);
#endif // Karma
 
    Enter();
    Solve();
 
    return 0;
 
}

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 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 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 3 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 348 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

# 결과 실행 시간 메모리 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 1 ms 376 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 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 348 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 380 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 504 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 504 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 3 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

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 8484 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 12 ms 8440 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 78 ms 8440 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 14 ms 8444 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 86 ms 8440 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 83 ms 8440 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 82 ms 8568 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 66 ms 8440 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 71 ms 8568 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 96 ms 8568 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 81572 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 87 ms 81656 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 795 ms 82236 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 99 ms 82248 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1528 ms 81896 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 938 ms 81912 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 828 ms 82296 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 607 ms 82076 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 796 ms 82052 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1002 ms 82040 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845