oj.uz

답안 #316645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316645 2020-10-27T00:36:52 Z ant101 K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 214 ms 4164 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second
 
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 1e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
 
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}
 
using namespace io;
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
 
namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
 
using namespace output;
 
using namespace input;
 
ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}
 
ll mul(ll a, ll b) {
    return (a * b)%MOD;
}
 
void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}

ll N, K;
ll arr[MX];
map<ll, ll> cc;
ll dp[2][MX];

int main() {
    re(N, K);
    setIO();
    FOR (i, 1, N+1) {
        re(arr[i]);
    }
    FOR (i, 1, MX) {
        dp[0][i] = 1e13;
        dp[1][i] = 1e13;
    }
    dp[0][0] = 0;
    FOR (i, 1, K+1) {
        stack<ll> dpstack, arrstack;
//        arrstack.push(1e13);
//        dpstack.push(1e13);
        FOR (j, i, N+1) {
            ll currmin = dp[0][j-1];
            while (arrstack.size() && arrstack.top() <= arr[j]) {
                currmin = min(currmin, dpstack.top());
                arrstack.pop();
                dpstack.pop();
            }
            if (!arrstack.size()) {
                arrstack.push(arr[j]);
                dpstack.push(currmin);
            } else if (arrstack.top()+dpstack.top() >= arr[j]+currmin) {
                arrstack.push(arr[j]);
                dpstack.push(currmin);
            }
            dp[1][j] = dpstack.top()+arrstack.top();
//            ps(i, j, dp[1][j]);
        }
        FOR (j, 1, N+1) {
            dp[0][j] = dp[1][j];
            dp[1][j] = 1e13;
        }
    }
    ps(dp[0][N]);
}

Compilation message

blocks.cpp: In function 'void io::setIn(std::string)':
blocks.cpp:67:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   67 |     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
blocks.cpp: In function 'void io::setOut(std::string)':
blocks.cpp:68:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 1 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 1 ms 1920 KB Output is correct
14 Correct 1 ms 1920 KB Output is correct
15 Correct 1 ms 1920 KB Output is correct
16 Correct 1 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 1 ms 1920 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 1 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 1 ms 1920 KB Output is correct
9 Correct 1 ms 1920 KB Output is correct
10 Correct 1 ms 1920 KB Output is correct
11 Correct 1 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 2 ms 1920 KB Output is correct
14 Correct 1 ms 1920 KB Output is correct
15 Correct 2 ms 1920 KB Output is correct
16 Correct 1 ms 1792 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 1 ms 1920 KB Output is correct
19 Correct 1 ms 1920 KB Output is correct
20 Correct 1 ms 1920 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 1 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 1 ms 1920 KB Output is correct
14 Correct 1 ms 1920 KB Output is correct
15 Correct 1 ms 1920 KB Output is correct
16 Correct 1 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 1 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 1 ms 1920 KB Output is correct
21 Correct 1 ms 1920 KB Output is correct
22 Correct 1 ms 1920 KB Output is correct
23 Correct 1 ms 1920 KB Output is correct
24 Correct 1 ms 1920 KB Output is correct
25 Correct 1 ms 1920 KB Output is correct
26 Correct 1 ms 1920 KB Output is correct
27 Correct 1 ms 1920 KB Output is correct
28 Correct 1 ms 1920 KB Output is correct
29 Correct 1 ms 1920 KB Output is correct
30 Correct 1 ms 1920 KB Output is correct
31 Correct 2 ms 1920 KB Output is correct
32 Correct 1 ms 1920 KB Output is correct
33 Correct 2 ms 1920 KB Output is correct
34 Correct 1 ms 1792 KB Output is correct
35 Correct 2 ms 1920 KB Output is correct
36 Correct 1 ms 1920 KB Output is correct
37 Correct 1 ms 1920 KB Output is correct
38 Correct 1 ms 1920 KB Output is correct
39 Correct 1 ms 1920 KB Output is correct
40 Correct 2 ms 1920 KB Output is correct
41 Correct 2 ms 1920 KB Output is correct
42 Correct 1 ms 1920 KB Output is correct
43 Correct 1 ms 1920 KB Output is correct
44 Correct 1 ms 1920 KB Output is correct
45 Correct 1 ms 1920 KB Output is correct
46 Correct 1 ms 1920 KB Output is correct
47 Correct 1 ms 1920 KB Output is correct
48 Correct 1 ms 1920 KB Output is correct
49 Correct 1 ms 1920 KB Output is correct
50 Correct 1 ms 1920 KB Output is correct
51 Correct 2 ms 1920 KB Output is correct
52 Correct 1 ms 1920 KB Output is correct
53 Correct 2 ms 1920 KB Output is correct
54 Correct 2 ms 1920 KB Output is correct
55 Correct 1 ms 1920 KB Output is correct
56 Correct 2 ms 1920 KB Output is correct
57 Correct 2 ms 1920 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 1 ms 1920 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 1 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 1 ms 1920 KB Output is correct
14 Correct 1 ms 1920 KB Output is correct
15 Correct 1 ms 1920 KB Output is correct
16 Correct 1 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 1 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 1 ms 1920 KB Output is correct
21 Correct 1 ms 1920 KB Output is correct
22 Correct 1 ms 1920 KB Output is correct
23 Correct 1 ms 1920 KB Output is correct
24 Correct 1 ms 1920 KB Output is correct
25 Correct 1 ms 1920 KB Output is correct
26 Correct 1 ms 1920 KB Output is correct
27 Correct 1 ms 1920 KB Output is correct
28 Correct 1 ms 1920 KB Output is correct
29 Correct 1 ms 1920 KB Output is correct
30 Correct 1 ms 1920 KB Output is correct
31 Correct 2 ms 1920 KB Output is correct
32 Correct 1 ms 1920 KB Output is correct
33 Correct 2 ms 1920 KB Output is correct
34 Correct 1 ms 1792 KB Output is correct
35 Correct 2 ms 1920 KB Output is correct
36 Correct 1 ms 1920 KB Output is correct
37 Correct 1 ms 1920 KB Output is correct
38 Correct 1 ms 1920 KB Output is correct
39 Correct 1 ms 1920 KB Output is correct
40 Correct 2 ms 1920 KB Output is correct
41 Correct 2 ms 1920 KB Output is correct
42 Correct 1 ms 1920 KB Output is correct
43 Correct 1 ms 1920 KB Output is correct
44 Correct 1 ms 1920 KB Output is correct
45 Correct 1 ms 1920 KB Output is correct
46 Correct 1 ms 1920 KB Output is correct
47 Correct 1 ms 1920 KB Output is correct
48 Correct 1 ms 1920 KB Output is correct
49 Correct 1 ms 1920 KB Output is correct
50 Correct 1 ms 1920 KB Output is correct
51 Correct 2 ms 1920 KB Output is correct
52 Correct 1 ms 1920 KB Output is correct
53 Correct 2 ms 1920 KB Output is correct
54 Correct 2 ms 1920 KB Output is correct
55 Correct 1 ms 1920 KB Output is correct
56 Correct 2 ms 1920 KB Output is correct
57 Correct 2 ms 1920 KB Output is correct
58 Correct 5 ms 2048 KB Output is correct
59 Correct 7 ms 2688 KB Output is correct
60 Correct 10 ms 2560 KB Output is correct
61 Correct 50 ms 2560 KB Output is correct
62 Correct 148 ms 3436 KB Output is correct
63 Correct 15 ms 3328 KB Output is correct
64 Correct 68 ms 3440 KB Output is correct
65 Correct 2 ms 1920 KB Output is correct
66 Correct 1 ms 1920 KB Output is correct
67 Correct 2 ms 1920 KB Output is correct
68 Correct 2 ms 1920 KB Output is correct
69 Correct 1 ms 1920 KB Output is correct
70 Correct 2 ms 1920 KB Output is correct
71 Correct 14 ms 2048 KB Output is correct
72 Correct 3 ms 2048 KB Output is correct
73 Correct 5 ms 2048 KB Output is correct
74 Correct 6 ms 2560 KB Output is correct
75 Correct 9 ms 2560 KB Output is correct
76 Correct 42 ms 2560 KB Output is correct
77 Correct 111 ms 3328 KB Output is correct
78 Correct 14 ms 3328 KB Output is correct
79 Correct 56 ms 3436 KB Output is correct
80 Correct 13 ms 3456 KB Output is correct
81 Correct 20 ms 3328 KB Output is correct
82 Correct 119 ms 3328 KB Output is correct
83 Correct 2 ms 1920 KB Output is correct
84 Correct 2 ms 1920 KB Output is correct
85 Correct 20 ms 2176 KB Output is correct
86 Correct 4 ms 2176 KB Output is correct
87 Correct 7 ms 2176 KB Output is correct
88 Correct 7 ms 2560 KB Output is correct
89 Correct 11 ms 2892 KB Output is correct
90 Correct 68 ms 2892 KB Output is correct
91 Correct 214 ms 4164 KB Output is correct
92 Correct 16 ms 3968 KB Output is correct
93 Correct 98 ms 4144 KB Output is correct
94 Correct 3 ms 2048 KB Output is correct
95 Correct 15 ms 2120 KB Output is correct
96 Correct 2 ms 1920 KB Output is correct
97 Correct 1 ms 1920 KB Output is correct
98 Correct 2 ms 1920 KB Output is correct
99 Correct 1 ms 1920 KB Output is correct