oj.uz

Submission #242675

# Submission time Handle Problem Language Result Execution time Memory
242675 2020-06-28T23:07:43 Z AmineWeslati Feast (NOI19_feast) C++14
51 / 100
 1000 ms 75640 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int t[300001];
int pref[300001];
int memo[3000][3001];
int N,K;

int solve(int i, int r){
   if(!r) return 0;
   if(i==N) return -INF;
   if(memo[i][r]!=-1) return memo[i][r];
   int ans=solve(i,r-1);
   for(int j=i; j<N; j++){
      for(int k=j; k<N; k++){
         ans=max(ans,solve(k+1,r-1)+pref[k+1]-pref[j]);
      }
   }
   return memo[i][r]=ans;
}

int32_t main(){
   boost;
   memset(memo,-1,sizeof(memo));
   cin>>N>>K;
   pref[0]=0;
   int cnt=0;
   for(int i=0; i<N; i++){
      cin>>t[i];
      pref[i+1]=t[i];
      if(i) pref[i+1]+=pref[i];
      if(t[i]<0) cnt++;
   }

   if(cnt==0 ||(cnt==1 && K>1)){
      int res=0;
      for(int i=0; i<N; i++) if(t[i]>0) res+=t[i];
      cout << res << endl;
   }
   else if(cnt==1){
      int s=0,ss=0,sss=0;
      int idx=0;
      while(t[idx]>=0){s+=t[idx]; idx++;}
      sss+=t[idx]; idx++;
      while(idx<N && t[idx]>=0){ss+=t[idx]; idx++;}
      cout << max(max(s,ss),s+ss+sss) << endl;
   }
   else if(K==1){
      int s=0;
      int res=0;
      for(int i=0; i<N; i++){
         s+=t[i];
         res=max(res,s);
         if(s<=0) s=0;
      }
      cout << res << endl;
   }
   else if(N<=3005){
      int res=0;
      for(int i=0; i<N; i++) res=max(res,solve(i,K));
      cout << res << endl;
   }


   return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 75384 KB Output is correct
2 Correct 85 ms 75504 KB Output is correct
3 Correct 83 ms 75512 KB Output is correct
4 Correct 81 ms 75640 KB Output is correct
5 Correct 83 ms 75384 KB Output is correct
6 Correct 83 ms 75384 KB Output is correct
7 Correct 79 ms 75384 KB Output is correct
8 Correct 79 ms 75512 KB Output is correct
9 Correct 81 ms 75524 KB Output is correct
10 Correct 77 ms 75384 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 75384 KB Output is correct
2 Correct 61 ms 75512 KB Output is correct
3 Correct 68 ms 75384 KB Output is correct
4 Correct 62 ms 75512 KB Output is correct
5 Correct 79 ms 75384 KB Output is correct
6 Correct 65 ms 75384 KB Output is correct
7 Correct 63 ms 75516 KB Output is correct
8 Correct 79 ms 75512 KB Output is correct
9 Correct 84 ms 75384 KB Output is correct
10 Correct 65 ms 75516 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 75384 KB Output is correct
2 Correct 91 ms 75384 KB Output is correct
3 Correct 88 ms 75384 KB Output is correct
4 Correct 92 ms 75568 KB Output is correct
5 Correct 89 ms 75384 KB Output is correct
6 Correct 84 ms 75512 KB Output is correct
7 Correct 90 ms 75512 KB Output is correct
8 Correct 93 ms 75384 KB Output is correct
9 Correct 88 ms 75640 KB Output is correct
10 Correct 84 ms 75468 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 70776 KB Output is correct
2 Correct 49 ms 70776 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 45 ms 70776 KB Output is correct
5 Correct 41 ms 70776 KB Output is correct
6 Correct 41 ms 70784 KB Output is correct
7 Correct 42 ms 70776 KB Output is correct
8 Correct 41 ms 70784 KB Output is correct
9 Correct 39 ms 70784 KB Output is correct
10 Correct 42 ms 70784 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 70776 KB Output is correct
2 Correct 49 ms 70776 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 45 ms 70776 KB Output is correct
5 Correct 41 ms 70776 KB Output is correct
6 Correct 41 ms 70784 KB Output is correct
7 Correct 42 ms 70776 KB Output is correct
8 Correct 41 ms 70784 KB Output is correct
9 Correct 39 ms 70784 KB Output is correct
10 Correct 42 ms 70784 KB Output is correct
11 Correct 282 ms 70776 KB Output is correct
12 Correct 302 ms 70880 KB Output is correct
13 Correct 130 ms 70912 KB Output is correct
14 Correct 263 ms 70912 KB Output is correct
15 Correct 199 ms 70776 KB Output is correct
16 Correct 137 ms 70776 KB Output is correct
17 Correct 340 ms 71032 KB Output is correct
18 Correct 63 ms 70776 KB Output is correct
19 Correct 103 ms 70784 KB Output is correct
20 Correct 87 ms 70784 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 70776 KB Output is correct
2 Correct 49 ms 70776 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 45 ms 70776 KB Output is correct
5 Correct 41 ms 70776 KB Output is correct
6 Correct 41 ms 70784 KB Output is correct
7 Correct 42 ms 70776 KB Output is correct
8 Correct 41 ms 70784 KB Output is correct
9 Correct 39 ms 70784 KB Output is correct
10 Correct 42 ms 70784 KB Output is correct
11 Correct 282 ms 70776 KB Output is correct
12 Correct 302 ms 70880 KB Output is correct
13 Correct 130 ms 70912 KB Output is correct
14 Correct 263 ms 70912 KB Output is correct
15 Correct 199 ms 70776 KB Output is correct
16 Correct 137 ms 70776 KB Output is correct
17 Correct 340 ms 71032 KB Output is correct
18 Correct 63 ms 70776 KB Output is correct
19 Correct 103 ms 70784 KB Output is correct
20 Correct 87 ms 70784 KB Output is correct
21 Execution timed out 1094 ms 70904 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 75384 KB Output is correct
2 Correct 85 ms 75504 KB Output is correct
3 Correct 83 ms 75512 KB Output is correct
4 Correct 81 ms 75640 KB Output is correct
5 Correct 83 ms 75384 KB Output is correct
6 Correct 83 ms 75384 KB Output is correct
7 Correct 79 ms 75384 KB Output is correct
8 Correct 79 ms 75512 KB Output is correct
9 Correct 81 ms 75524 KB Output is correct
10 Correct 77 ms 75384 KB Output is correct
11 Correct 68 ms 75384 KB Output is correct
12 Correct 61 ms 75512 KB Output is correct
13 Correct 68 ms 75384 KB Output is correct
14 Correct 62 ms 75512 KB Output is correct
15 Correct 79 ms 75384 KB Output is correct
16 Correct 65 ms 75384 KB Output is correct
17 Correct 63 ms 75516 KB Output is correct
18 Correct 79 ms 75512 KB Output is correct
19 Correct 84 ms 75384 KB Output is correct
20 Correct 65 ms 75516 KB Output is correct
21 Correct 83 ms 75384 KB Output is correct
22 Correct 91 ms 75384 KB Output is correct
23 Correct 88 ms 75384 KB Output is correct
24 Correct 92 ms 75568 KB Output is correct
25 Correct 89 ms 75384 KB Output is correct
26 Correct 84 ms 75512 KB Output is correct
27 Correct 90 ms 75512 KB Output is correct
28 Correct 93 ms 75384 KB Output is correct
29 Correct 88 ms 75640 KB Output is correct
30 Correct 84 ms 75468 KB Output is correct
31 Correct 39 ms 70776 KB Output is correct
32 Correct 49 ms 70776 KB Output is correct
33 Correct 41 ms 70776 KB Output is correct
34 Correct 45 ms 70776 KB Output is correct
35 Correct 41 ms 70776 KB Output is correct
36 Correct 41 ms 70784 KB Output is correct
37 Correct 42 ms 70776 KB Output is correct
38 Correct 41 ms 70784 KB Output is correct
39 Correct 39 ms 70784 KB Output is correct
40 Correct 42 ms 70784 KB Output is correct
41 Correct 282 ms 70776 KB Output is correct
42 Correct 302 ms 70880 KB Output is correct
43 Correct 130 ms 70912 KB Output is correct
44 Correct 263 ms 70912 KB Output is correct
45 Correct 199 ms 70776 KB Output is correct
46 Correct 137 ms 70776 KB Output is correct
47 Correct 340 ms 71032 KB Output is correct
48 Correct 63 ms 70776 KB Output is correct
49 Correct 103 ms 70784 KB Output is correct
50 Correct 87 ms 70784 KB Output is correct
51 Execution timed out 1094 ms 70904 KB Time limit exceeded
52 Halted 0 ms 0 KB -