oj.uz

Submission #699511

# Submission time Handle Problem Language Result Execution time Memory
699511 2023-02-17T08:38:19 Z Alihan_8 Stove (JOI18_stove) C++17
50 / 100
 121 ms 262144 KB 
#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;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k; cin >> n >> k;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    const int inf = 1e16+1;
    vector <vector<int>> dp(n+1, vector <int> (k+1, inf));
    dp[1][1] = 1;
    for ( int i = 2; i <= n; i++ ){
        for ( int j = 1; j <= k; j++ ){
            dp[i][j] = min(dp[i-1][j-1]+1, dp[i-1][j]+(p[i-1]-p[i-2]));
        }
    }
    cout << dp[n][k];

	cout << '\n';
}

Compilation message

stove.cpp: In function 'void IO(std::string)':
stove.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 15 ms 23896 KB Output is correct
13 Correct 28 ms 47356 KB Output is correct
14 Correct 46 ms 68552 KB Output is correct
15 Correct 40 ms 70672 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 15 ms 23896 KB Output is correct
13 Correct 28 ms 47356 KB Output is correct
14 Correct 46 ms 68552 KB Output is correct
15 Correct 40 ms 70672 KB Output is correct
16 Correct 19 ms 13780 KB Output is correct
17 Correct 63 ms 84152 KB Output is correct
18 Runtime error 121 ms 262144 KB Execution killed with signal 9
19 Halted 0 ms 0 KB -