oj.uz

Submission #1103125

# Submission time Handle Problem Language Result Execution time Memory
1103125 2024-10-20T07:43:13 Z khoaha123 Feast (NOI19_feast) C++14
51 / 100
 1000 ms 35400 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define ii pair<int,int>
#define task "bai1"
#define all(x) x.begin(),x.end()
#define MASK(x) (1 << (x))
#define int long long
using namespace std;
const int N = 3e5 + 5;
const int LOG = 20;
const int mod = 998244353;
const long long INF = 1e18;

int n,a[N],dp[305][305][305],s[N];

int calc(int l,int r,int k){
    if (k == 0) return 0;
    if (l == r) return max(a[l],0LL);
    int &res = dp[l][r][k];
    if (res != -1) return res;
    res = 0;

    for (int i = l; i < r; ++i){
        for (int j = 0; j <= min(k,(i-l+1)); ++j){
            res = max(res,calc(l,i,j) + calc(i+1,r,k-j));
        }
    }
    res = max(res,s[r] - s[l-1]);
    return res;
}
int k;
void subtask1(void){
    int sum = 0;
    for (int i = 1; i <= n; ++i) sum += a[i];
    cout << sum;
}

void subtask2(void){
    int pos = -1;

    for (int i = 1; i <= n; ++i){
        if (a[i] < 0){
            pos = i;break;
        }
    }
    if (pos == -1){
        subtask1();return;
    }
    int sum = 0;
    for (int i = 1; i <= n; ++i) sum += a[i];
    if (k == 1){

        int sum1 = 0,sum2 = 0;
        for (int i = 1; i < pos; ++i) sum1 += a[i];
        for (int i = pos+1; i <= n; ++i) sum2 += a[i];
        cout << max(sum1,max(sum2,sum));
    }
    else {
        cout << max(sum,sum - a[pos]);
    }
}

void subtask3(void){
    int best = 0;
    int sum = 0;
    for (int i = 1; i <= n; ++i){
        sum = max(a[i],sum + a[i]);
        best = max(best,sum);
    }
    cout << best;
}

void subtask4(void){
    memset(dp,-1,sizeof(dp));

    cout << calc(1,n,k) << endl;

}

int f[2005][2005];
void subtask5(void){
    int ans = 0;
    for (int i = 1; i <= n; ++i){
        for (int j = 0; j <= k; ++j) f[i][j] = f[i-1][j];
        for (int j = 0; j < i ;++j){
            for (int l = 0; l < k; ++l){
                f[i][l+1] = max(f[i][l+1],max(f[j][l] + s[i] - s[j],f[j][l]));
                ans = max(ans,f[i][l+1]);
            }
        }
    }

    cout << ans;
}

long long Rand(long long l, long long r) {
    long long res = 0;
    for (int i= 1; i <= 4; ++i) res = (res << 15) ^ (rand() & ((1 << 15) - 1));
    return l + res % (r-l+1);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        freopen(task".OUT","w",stdout);
    }
    srand(time(NULL));
    cin >> n >> k;


    int sub1 = 0,am = 0;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        //a[i] = Rand(-1000000000,1000000000);
        if (a[i] >= 0) sub1++;
        else am++;
        s[i] = s[i-1] + a[i];
    }
    
    if (sub1 == n){
        subtask1();
        return 0;
    }
  	if (k == 1){
        subtask3();
        return 0;
    }
    if (am == 1){
        subtask2();
        return 0;
    }

    subtask5();
    return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:107:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
feast.cpp:108:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |         freopen(task".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8016 KB Output is correct
2 Correct 22 ms 8016 KB Output is correct
3 Correct 24 ms 8016 KB Output is correct
4 Correct 26 ms 8016 KB Output is correct
5 Correct 28 ms 7952 KB Output is correct
6 Correct 22 ms 8064 KB Output is correct
7 Correct 21 ms 7936 KB Output is correct
8 Correct 25 ms 8016 KB Output is correct
9 Correct 23 ms 8016 KB Output is correct
10 Correct 23 ms 8016 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8016 KB Output is correct
2 Correct 15 ms 8188 KB Output is correct
3 Correct 14 ms 8016 KB Output is correct
4 Correct 13 ms 8016 KB Output is correct
5 Correct 21 ms 8032 KB Output is correct
6 Correct 14 ms 8016 KB Output is correct
7 Correct 13 ms 8016 KB Output is correct
8 Correct 31 ms 8096 KB Output is correct
9 Correct 21 ms 7904 KB Output is correct
10 Correct 13 ms 8016 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 8148 KB Output is correct
2 Correct 25 ms 7972 KB Output is correct
3 Correct 24 ms 8016 KB Output is correct
4 Correct 23 ms 8020 KB Output is correct
5 Correct 24 ms 8016 KB Output is correct
6 Correct 24 ms 7948 KB Output is correct
7 Correct 24 ms 8016 KB Output is correct
8 Correct 24 ms 8016 KB Output is correct
9 Correct 24 ms 8024 KB Output is correct
10 Correct 24 ms 8016 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6608 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 4432 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6608 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 4432 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct
11 Correct 4 ms 10576 KB Output is correct
12 Correct 4 ms 8528 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 10576 KB Output is correct
15 Correct 3 ms 8696 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 4 ms 10776 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 10576 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6608 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 4432 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct
11 Correct 4 ms 10576 KB Output is correct
12 Correct 4 ms 8528 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 10576 KB Output is correct
15 Correct 3 ms 8696 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 4 ms 10776 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 10576 KB Output is correct
21 Correct 472 ms 35400 KB Output is correct
22 Execution timed out 1039 ms 21120 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8016 KB Output is correct
2 Correct 22 ms 8016 KB Output is correct
3 Correct 24 ms 8016 KB Output is correct
4 Correct 26 ms 8016 KB Output is correct
5 Correct 28 ms 7952 KB Output is correct
6 Correct 22 ms 8064 KB Output is correct
7 Correct 21 ms 7936 KB Output is correct
8 Correct 25 ms 8016 KB Output is correct
9 Correct 23 ms 8016 KB Output is correct
10 Correct 23 ms 8016 KB Output is correct
11 Correct 15 ms 8016 KB Output is correct
12 Correct 15 ms 8188 KB Output is correct
13 Correct 14 ms 8016 KB Output is correct
14 Correct 13 ms 8016 KB Output is correct
15 Correct 21 ms 8032 KB Output is correct
16 Correct 14 ms 8016 KB Output is correct
17 Correct 13 ms 8016 KB Output is correct
18 Correct 31 ms 8096 KB Output is correct
19 Correct 21 ms 7904 KB Output is correct
20 Correct 13 ms 8016 KB Output is correct
21 Correct 24 ms 8148 KB Output is correct
22 Correct 25 ms 7972 KB Output is correct
23 Correct 24 ms 8016 KB Output is correct
24 Correct 23 ms 8020 KB Output is correct
25 Correct 24 ms 8016 KB Output is correct
26 Correct 24 ms 7948 KB Output is correct
27 Correct 24 ms 8016 KB Output is correct
28 Correct 24 ms 8016 KB Output is correct
29 Correct 24 ms 8024 KB Output is correct
30 Correct 24 ms 8016 KB Output is correct
31 Correct 1 ms 4432 KB Output is correct
32 Correct 1 ms 6480 KB Output is correct
33 Correct 1 ms 6648 KB Output is correct
34 Correct 1 ms 6480 KB Output is correct
35 Correct 1 ms 6480 KB Output is correct
36 Correct 1 ms 6608 KB Output is correct
37 Correct 1 ms 6480 KB Output is correct
38 Correct 1 ms 6480 KB Output is correct
39 Correct 2 ms 4432 KB Output is correct
40 Correct 1 ms 6480 KB Output is correct
41 Correct 4 ms 10576 KB Output is correct
42 Correct 4 ms 8528 KB Output is correct
43 Correct 3 ms 8540 KB Output is correct
44 Correct 3 ms 10576 KB Output is correct
45 Correct 3 ms 8696 KB Output is correct
46 Correct 2 ms 8528 KB Output is correct
47 Correct 4 ms 10776 KB Output is correct
48 Correct 2 ms 8528 KB Output is correct
49 Correct 2 ms 8528 KB Output is correct
50 Correct 2 ms 10576 KB Output is correct
51 Correct 472 ms 35400 KB Output is correct
52 Execution timed out 1039 ms 21120 KB Time limit exceeded
53 Halted 0 ms 0 KB -