QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#695636 | #5417. Chat Program | yaLen | WA | 27ms | 26764kb | C++14 | 1.9kb | 2024-10-31 20:29:34 | 2024-10-31 20:29:35 |
Judging History
answer
#include <bits/stdc++.h>
#define KE ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
#define int long long
#define flt(x) cout << fixed << setprecision(x);
#define all(x) (x).begin(), (x).end()
#define bcount(t) __builtin_popcount(t)
#define Mod(x,m) (((x) % m + m) % m)
#define flip(x) reverse(x)
#define lowbit(x) (x&(-x))
#define bemax(x,y) x = max(x, y)
#define pb push_back
#define elif else if
#define endl '\n'
#define AA cerr << "AA" << endl;
#define __ << " " <<
const int N = 1e6 + 10;
const int inf = 1e18;
const int mod = 1e9 + 7;
typedef pair<int, int> pii;
int n,k,m,c,d;
vector<int> a(N);
int lst;
bool check(int x){
vector<int>tag(N);
vector<int>f(N);
int res = 0;
for(int i = 1; i <= n; i++){
if(a[i] >= x){
res++;
tag[i] = 1;
if(res >= k) return true;
}
}
for(int i = 1; i <= m; i++){
if(tag[i] == 1) continue;
if(a[i] + c + (i - 1) * d >= x){
f[m]++;
if(a[i] + c >= x){
f[i + m]--;
}else{
//a[i] + c + p * d < x
int p = (x - c - a[i]) / d;
int det = i - p;
f[m + det]--;
}
}
}
for(int i = m + 1; i <= n; i++){
if(tag[i] == 1) continue;
if(a[i] + lst >= x){
f[i]++;
if(a[i] + c >= x) f[i + m]--;
else{
int p = (x - c - a[i]) / d;
int det = m - p - 1;
f[i + det]--;
}
}
}
// for(int i = 1; i <= n; i++){
// cout << f[i] << " ";
// }cout << endl;
for(int i = m; i <= n; i++){
res += f[i];
if(res >= k){
return 1;
}
}
return false;
}
void solve(){
cin >> n >> k >> m >> c >> d;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int lst = c + (m - 1) * d;
int l = 0, r = 1e18;
// maxn = c + (m - 1) * d;
while(l < r){
int mid = (l + r + 1) / 2;
// cerr << mid << endl;
if(check(mid))l = mid;
else r = mid - 1;
}
cout << l << endl;
}
signed main(){
KE;
int T = 1;
// cin >> T;
// flt(3);
while(T--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 27ms
memory: 26764kb
input:
6 4 3 1 2 1 1 4 5 1 4
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: -100
Wrong Answer
time: 20ms
memory: 26644kb
input:
7 3 2 4 0 1 9 1 9 8 1 0
output:
8
result:
wrong answer 1st numbers differ - expected: '9', found: '8'