QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#718454 | #5417. Chat Program | Rightt | WA | 39ms | 8316kb | C++14 | 1.5kb | 2024-11-06 20:33:34 | 2024-11-06 20:33:35 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
ll n, k, m, c, d;
ll a[N], b[N], p[N];
bool check(ll x){
//难写!
//预处理<x的时刻
for (int i = 0; i < n; i ++ ) p[i] = 0;
int res = 0;
for (int i = 0; i < n; i ++ ){
if (a[i] >= x){
res ++;
continue;
}
//
if (a[i] + (m - 1) * d + c < x) continue;
//存在<x的时刻
if (d == 0){
if (c + a[i] >= x){
int z = i - m + 1;
if (z < 0) continue;
p[z] ++;
}
continue;
}
int y = (x - a[i] - c + d - 1) / d;//加y次到达X
int z = i - m + 1 + y;
if (z < 0) continue;
p[z] ++;//使得 >= x
}
for (int i = 0; i < m; i ++ ) if (a[i] < x && a[i] + c + d * i >= x) res ++;
if (res == k) return true;
for (int i = 1; i + m - 1 < n; i ++ ){
res -= p[i-1];
res += p[i];
if (res >= k) return true;
}
return false;
}
void solve(){
cin >> n >> k >> m >> c >> d;
for (int i = 0; i < n; i ++ ) cin >> a[i];
ll l = 0, r = 1e9 * (2e5 + 10);
while (l < r){
ll mid = (l + r + 1) / 2;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << l;
}
signed main(){
IOS;
int t = 1;
// cin >> t;
while (t -- ){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5608kb
input:
6 4 3 1 2 1 1 4 5 1 4
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Accepted
time: 1ms
memory: 5644kb
input:
7 3 2 4 0 1 9 1 9 8 1 0
output:
9
result:
ok 1 number(s): "9"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
8 3 5 0 0 2 0 2 2 1 2 1 8
output:
2
result:
ok 1 number(s): "2"
Test #4:
score: 0
Accepted
time: 39ms
memory: 8012kb
input:
200000 200000 100000 0 1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: 0
Accepted
time: 33ms
memory: 8316kb
input:
200000 1 100000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 100000000...
output:
100001000000000
result:
ok 1 number(s): "100001000000000"
Test #6:
score: -100
Wrong Answer
time: 36ms
memory: 8096kb
input:
200000 1 200000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 100000000...
output:
0
result:
wrong answer 1st numbers differ - expected: '200001000000000', found: '0'