oj.uz

Submission #375133

# Submission time Handle Problem Language Result Execution time Memory
375133 2021-03-09T03:31:37 Z Edbert2397 Stove (JOI18_stove) C++14
20 / 100
 55 ms 492 KB 
/*
~2021~
*/
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
#define pii pair<int,int>
const int N = 2e5 + 5;
const int INF = 1e9;
const ll mod = 1e9+7;
int n,k,arr[30];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen(,r,stdin);
    //freopen(,w,stdout);
    cin>>n>>k;
    for(int i = 0;i<n;i++){
        cin>>arr[i];
    }
    int fullmask = (1<<n);
    int ans = arr[n-1] - arr[0] + 1;
    for(int mask = 0;mask < fullmask;mask++){
        int nyala = 0,cnt = 0;
        for(int j = 0;j<n;j++){
            if(mask & (1<<j)) nyala++;
        }
        if((mask & (1<<(n-1))) == 0) nyala++; //kalau pagar terakir bukan di terakir ada nyala + 1 segmen jadinya
        if(nyala <= k){
            int PREV = 0;
            for(int j = 0;j<n;j++){
                if(mask & (1<<j)) {
                    cnt += (arr[j] - arr[PREV] + 1); 
                    PREV = j + 1;
                }
            }
            if((mask & (1<<(n-1))) == 0) cnt += (arr[n-1] - arr[PREV] + 1);
            //cout<<mask<<" cnt = "<<cnt<<endl;
            ans = min(ans,cnt);
        }
    }
    cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 55 ms 392 KB Output is correct
9 Correct 1 ms 492 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 55 ms 392 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Runtime error 1 ms 492 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 55 ms 392 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Runtime error 1 ms 492 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -