oj.uz

답안 #231173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231173 2020-05-13T01:28:45 Z infinite_iq K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 15 ms 8960 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 547
//#define mp make_pair
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll inf=1e18;
const ll mod=1e9+7;
const ld pai=acos(-1);
ll n , k ;
ll a[100009] ;
ll dp [100009][109] ;
int main () {
        scanf("%lld%lld",&n,&k) ;
        for ( int i = 1 ; i <= n ; i ++ ) scanf("%lld",&a[i]) ;
        for ( int i = 1 ; i <= n ; i ++ ) {
                dp [i][1] = max ( dp [i-1][1] , a[i] ) ;
        }
        dp [0][1] = inf ;
        for ( int i = 0 ; i <= n ; i ++ ) {
                for ( int j = 2 ; j <= k ; j ++ ) {
                        dp [i][j] = inf ;
                }
        }
        for ( int j = 2 ; j <= k ; j ++ ) {
                stack < pll > st ;
                for ( int i = 1 ; i <  j ; i ++ ) st .push ( { i , dp [i][j-1] } ) ;
                for ( int i = j ; i <= n ; i ++ ) {
                        ll val1 = inf , val2 = inf ;
                        while ( st . size () ) {
                                ll id = st.top ().fi , crnt = st.top().se ;
                                val1 = min ( val1 , crnt ) ;
                                if ( a [id] > a[i] ) break ;
                                st .pop () ;
                        }
                        if ( st . size () ) val2 = dp [st.top().fi][j] ;
                        st .push ( { i , min ( val1 , dp[i][j-1] ) } ) ;
                        val1 += a[i] ;
                        dp [i][j] = min ( val1 , val2 ) ;
                }
        }
        cout << dp[n][k] << endl ;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&n,&k) ;
         ~~~~~^~~~~~~~~~~~~~~~~~
blocks.cpp:36:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for ( int i = 1 ; i <= n ; i ++ ) scanf("%lld",&a[i]) ;
                                           ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Incorrect 4 ms 384 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Incorrect 5 ms 384 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 8960 KB Output isn't correct
2 Halted 0 ms 0 KB -