oj.uz

Submission #833135

# Submission time Handle Problem Language Result Execution time Memory
833135 2023-08-22T02:06:30 Z veehj Feast (NOI19_feast) C++17
0 / 100
 1000 ms 5032 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
int n, k; vector<ll> a={0};

void f(){
    vector<ll> p=a;
    for(int i=1; i<n; i++) p[i]+=p[i-1];
    ll ans=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<i; j++){
            ans=max(ans, p[i]-p[j]);
        }
    }
    cout << ans << endl;
    return;
}

int main(){
    cin >> n >> k;
    for(int i=0; i<n; i++){
        ll x; cin >> x;
        a.pb(x);
    }
    if(k==1) f();
    else{
        ll cnt=0;
        for(int i=0; i<n; i++) if(a[i]>0) cnt+=a[i];
        cout << cnt << endl;
    }
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 4552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 4916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1025 ms 5032 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 4552 KB Output isn't correct
2 Halted 0 ms 0 KB -