oj.uz

답안 #1022473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022473 2024-07-13T14:45:42 Z daffuwu 수열 (APIO14_sequence) C++14
50 / 100
 2000 ms 44572 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, opt[100002][202];
long long ps[100069], dp[100069][2], val;

int main() 
{
    int i, j, c;
    scanf("%d%d", &n, &k);
    k++;
    for (i=1; i<=n; i++)
    {
        scanf("%lld", ps+i);
        ps[i] += ps[i-1];
        dp[i][0] = -1e15;
    }
    for (c=1; c<=k; c++)
    {
        dp[0][c%2] = -1e15;
        for (i=1; i<=n; i++)
        {
            dp[i][c%2] = -1e15;
            for (j=i-1; j>=0; j--)
            {
                val = dp[j][(c+1)%2]+(ps[i]-ps[j])*ps[j];
                if (val>dp[i][c%2])
                {
                    dp[i][c%2] = val;
                    opt[i][c] = j;
                }
            }
        }
    }
    printf("%lld\n", dp[n][k%2]);
    for (i=n, c=k; c>=2; i=opt[i][c], c--)
    {
        printf("%d ", opt[i][c]);
    }
    printf("\n");
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d%d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%lld", ps+i);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 604 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 344 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 348 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 1 ms 348 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 448 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 344 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 344 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 1 ms 344 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 344 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 344 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 444 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 352 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 344 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 344 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 348 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 388 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 344 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 604 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 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 4 ms 604 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 5 ms 604 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 604 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 604 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 604 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 604 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1268 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 1116 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 121 ms 1280 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 1116 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 115 ms 1276 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 92 ms 1112 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 102 ms 1112 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 102 ms 1116 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 22 ms 1112 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 44 ms 1116 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 8532 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 263 ms 8528 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2048 ms 8532 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2029 ms 44572 KB Time limit exceeded
2 Halted 0 ms 0 KB -