oj.uz

답안 #237720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237720 2020-06-08T12:40:22 Z Half Feast (NOI19_feast) C++14
0 / 100
 1000 ms 4848 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];
vi 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 << g[0] << "\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";
    }else{
        cout << dp(0, K) << "\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
0 / 4.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 1528 KB Output is correct
2 Correct 98 ms 1528 KB Output is correct
3 Correct 95 ms 1528 KB Output is correct
4 Execution timed out 1085 ms 1528 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

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