oj.uz

Submission #958745

# Submission time Handle Problem Language Result Execution time Memory
958745 2024-04-06T13:49:38 Z hariaakas646 K blocks (IZhO14_blocks) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

int main() {
    // usaco();
    int n, k;
    scd(n);
    scd(k);
    vll vec(n+1);
    forr(i, 1, n+1) sclld(vec[i]);
    vector<vll> dp(k+1, vll(n+1, 1e17));
    dp[0][0] = 0;

    forr(i, 1, k+1) {
        stack<int> stk;
        stk.push(0);
        lli mi = 1e17;
        forr(j, 1, n+1) {
            while(stk.size() > 1&& vec[j] > vec[stk.top()]) {
                mi = min(mi, dp[i-1][stk.top()]);
                stk.pop();
            }
            dp[i][j] = mi + vec[j];
            dp[i][j] = min({dp[i][j], dp[i][stk.top()], dp[i-1][stk.top()]+vec[j]});
            if(vec[j] > vec[stk.top()]) stk.pop();
            stk.push(j);
        }
    }
    printf("%lld", dp[k][n]);
}

Compilation message

blocks.cpp: In function 'void usaco()':
blocks.cpp:29:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp: In function 'int main()':
blocks.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
blocks.cpp:36:5: note: in expansion of macro 'scd'
   36 |     scd(n);
      |     ^~~
blocks.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
blocks.cpp:37:5: note: in expansion of macro 'scd'
   37 |     scd(k);
      |     ^~~
blocks.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
blocks.cpp:39:21: note: in expansion of macro 'sclld'
   39 |     forr(i, 1, n+1) sclld(vec[i]);
      |                     ^~~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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