oj.uz

Submission #237725

# Submission time Handle Problem Language Result Execution time Memory
237725 2020-06-08T12:51:32 Z Half Feast (NOI19_feast) C++14
12 / 100
 1000 ms 5896 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long long ll;

#define loop(i,a,b) for (int i = a; i <= b; i++)

#define INF ((unsigned) ~0)
#define F first
#define S second
#define PB push_back
#define MP make_pair

const int MXN = 500000;
int N, K;
int a[MXN];
vector<ll> g;
vector<ll> sg;
//ll mem[4000][4000];

int dp(int l, int n){
    if(l >= g.size())
        return 0;
    if(n <= 0)
        return 0;
    //if(mem[l][n] != -1)
    //    return mem[l][n];
    ll sol = sg[l + 1] - sg[l];
    for(int i = l + 1; i <= g.size(); i++)
        for(int j = l; j <= i; j++)
            sol = max(sol, dp(i, n - 1) + sg[i] - sg[j]);
    //mem[l][n] = sol;
    return sol;
}

int main(){
    cin >> N >> K;
    for(int i = 0; i < N; i++){
        cin >> a[i];
        if(g.size() == 0){
            g.push_back(a[i]);
        }else if((g[g.size() - 1] >= 0 && a[i] >= 0) || (g[g.size() - 1] < 0 && a[i] < 0)){
            g[g.size() - 1] += a[i];
        }else{
            //cout << g[g.size() - 1] << " ";
            g.push_back(a[i]);
        }
    }
    //cout << "\n";
    /*for(int i = 0; i < 4000; i++)
        for(int j = 0; j < 4000; j++)
            mem[i][j] = -1;*/
    ll sm = 0;
    sg.push_back(0);
    for(int i = 0; i < g.size(); i++){
        sm += g[i];
        sg.push_back(sm);
    }
    if(g.size() == 1){
        cout << sm << "\n";
    }else if(g.size() == 2){
        cout << max(g[0], g[1]) << "\n";
    }else if(g.size() == 3 && g[0] > 0){
        if(K == 1)
            cout << max(max(g[0], g[2]), g[0] + g[1] + g[2]) << "\n";
        if(K >= 2)
            cout << g[0] + g[2] << "\n";
    }else if(K == 1){
        ll mx = 0;
        for(int i = 0; i < g.size(); i++)
            for(int j = i + 1; j < g.size() + 1; j++)
                mx = max(mx, sg[j] - sg[i]);
        cout << mx << "\n";
    }
}

Compilation message

feast.cpp: In function 'int dp(int, int)':
feast.cpp:30:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(l >= g.size())
        ~~^~~~~~~~~~~
feast.cpp:37:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = l + 1; i <= g.size(); i++)
                        ~~^~~~~~~~~~~
feast.cpp: In function 'int main()':
feast.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < g.size(); i++){
                    ~~^~~~~~~~~~
feast.cpp:78:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < g.size(); i++)
                        ~~^~~~~~~~~~
feast.cpp:79:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = i + 1; j < g.size() + 1; j++)
                                ~~^~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1528 KB Output is correct
2 Correct 179 ms 4344 KB Output is correct
3 Correct 179 ms 4344 KB Output is correct
4 Correct 181 ms 4348 KB Output is correct
5 Correct 179 ms 4472 KB Output is correct
6 Correct 176 ms 4344 KB Output is correct
7 Correct 178 ms 4344 KB Output is correct
8 Correct 179 ms 4344 KB Output is correct
9 Correct 181 ms 4344 KB Output is correct
10 Correct 177 ms 4408 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 1528 KB Output is correct
2 Correct 101 ms 1400 KB Output is correct
3 Correct 96 ms 1492 KB Output is correct
4 Correct 95 ms 1528 KB Output is correct
5 Correct 177 ms 1528 KB Output is correct
6 Correct 95 ms 2552 KB Output is correct
7 Correct 97 ms 2652 KB Output is correct
8 Correct 182 ms 4344 KB Output is correct
9 Correct 174 ms 4216 KB Output is correct
10 Correct 96 ms 2680 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1528 KB Output is correct
2 Correct 179 ms 4344 KB Output is correct
3 Correct 179 ms 4344 KB Output is correct
4 Correct 181 ms 4348 KB Output is correct
5 Correct 179 ms 4472 KB Output is correct
6 Correct 176 ms 4344 KB Output is correct
7 Correct 178 ms 4344 KB Output is correct
8 Correct 179 ms 4344 KB Output is correct
9 Correct 181 ms 4344 KB Output is correct
10 Correct 177 ms 4408 KB Output is correct
11 Correct 98 ms 1528 KB Output is correct
12 Correct 101 ms 1400 KB Output is correct
13 Correct 96 ms 1492 KB Output is correct
14 Correct 95 ms 1528 KB Output is correct
15 Correct 177 ms 1528 KB Output is correct
16 Correct 95 ms 2552 KB Output is correct
17 Correct 97 ms 2652 KB Output is correct
18 Correct 182 ms 4344 KB Output is correct
19 Correct 174 ms 4216 KB Output is correct
20 Correct 96 ms 2680 KB Output is correct
21 Execution timed out 1091 ms 5896 KB Time limit exceeded
22 Halted 0 ms 0 KB -