直接模拟?
水题
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 200000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int aa, b, ff, k, ans;
int a[maxn];
int main() {
scanf("%d %d %d %d", &aa, &b, &ff, &k);
int n = k+1, f = 1;
int t1 = 2*ff, t2 = 2*(aa-ff);
a[1] = t1 / 2; f = 1-f;
for(int i = 2; i < n; ++i) {
if(f) {
a[i] = t1;
f = 1-f;
}
else {
a[i] = t2;
f = 1-f;
}
}
if(f) a[n] = t1/2;
else a[n] = t2/2;
int c = b;
for(int i = 1; i <= n; ++i) {
//cout << a[i] << " == " << endl;
if(c < a[i]) {
c = b-a[i];
ans++;
}
else {
c -= a[i];
}
if(c < 0) { printf("-1\n"); return 0; }
}
printf("%d\n", ans);
return 0;
}