oj.uz

Submission #100799

# Submission time Handle Problem Language Result Execution time Memory
100799 2019-03-14T14:08:48 Z 1Khan K blocks (IZhO14_blocks) C++14
18 / 100
 1000 ms 1268 KB 
// In the name of GOD

#include <bits/stdc++.h>

using namespace std;

#define BeGood ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

typedef long long ll;
typedef double db;

const int N = 1e5 + 101;
const ll M = 1e13 + 7;

int n, k;
int a[N];
map<pair<int, int>, int> m;
long long man(int id, int al){
     if(al < 0){
          m[{id, al}] = M;
          return M;
     }
     if(id > n){
          if(al == 0){
               m[{id, al}] = 1;
               return 0;
          }
          m[{id, al}] = M;
          return M;
     }
     if(m[{id, al}] > 0){
          return m[{id, al}] - 1;
     }
     long long ans = M;
     int mx = 0;
     for(int i = id; i <= n; ++i){
          mx = max(mx, a[i]);
          ans = min(ans, man(i + 1, al - 1) + mx);
     }
     return ans;
}
int main(){

     BeGood

     cin >> n >> k;
     for(int i = 1; i <= n; ++i){
          cin >> a[i];
     }
     cout << man(1, k);
     return 0;
}

Compilation message

blocks.cpp: In function 'long long int man(int, int)':
blocks.cpp:27:25: warning: overflow in implicit constant conversion [-Woverflow]
           m[{id, al}] = M;
                         ^
blocks.cpp:35:25: warning: overflow in implicit constant conversion [-Woverflow]
           m[{id, al}] = M;
                         ^

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Execution timed out 1064 ms 384 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 20 ms 384 KB Output is correct
15 Correct 20 ms 384 KB Output is correct
16 Correct 28 ms 384 KB Output is correct
17 Correct 26 ms 384 KB Output is correct
18 Correct 18 ms 384 KB Output is correct
19 Correct 23 ms 384 KB Output is correct
20 Correct 30 ms 384 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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