oj.uz

Submission #1068527

# Submission time Handle Problem Language Result Execution time Memory
1068527 2024-08-21T10:28:49 Z kiethm07 Stove (JOI18_stove) C++11
0 / 100
 1 ms 460 KB 
#include <bits/stdc++.h>

#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second

#define vi vector<int>
#define vii vector<pii>
#define pb(i) push_back(i)
#define all(x) x.begin(),x.end()

#define TEXT "a"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
const int N = 1e5 + 5;

int a[N];
int n,k;

int check(int x){
    int cnt = 1;
    int total = 0;
    int cur = 0;
    for (int i = 2; i <= n; i++){
        int t = a[i] - a[i - 1];
        if (cur + t > x){
            total += cur;
            cur = 0;
            cnt++;
        }
        else cur += t;
    }
    total += cur;
    if (cnt > k) return -1;
    return total;
}

int main(){
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen(TEXT".inp","r")){
        freopen(TEXT".inp","r",stdin);
        freopen(TEXT".out","w",stdout);
    }
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    int l = 1;
    int r = inf;
    int res = inf;
    while(l <= r){
        int mid = (l + r) / 2;
        int t = check(mid);
        if (t != -1){
            r = mid - 1;
            res = t + k;
        }
        else l = mid + 1;
    }
    cout << res << "\n";
    return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(TEXT".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
stove.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen(TEXT".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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