QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#695492 | #5417. Chat Program | yaLen | WA | 68ms | 26832kb | C++14 | 1.9kb | 2024-10-31 20:08:46 | 2024-10-31 20:08:47 |
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 maxn;
bool check(int x){
vector<int>tag(N);
vector<int>f(N);
int res=0;
int lst = c + (m - 1) * d;
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;
f[i + det]--;
}
}
}
for(int i = m - 1; i < n; i++){
if(res >= k){
return 1;
}
res += f[i];
}
return false;
}
void solve(){
cin >> n >> k >> m >> c >> d;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int l = 0, r = 1e18;
maxn = c + (m - 1) * d;
while(l < r){
int mid = (l + r + 1) / 2;
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: 19ms
memory: 26628kb
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: 28ms
memory: 26764kb
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: 20ms
memory: 26552kb
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: 63ms
memory: 26832kb
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: 64ms
memory: 26544kb
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: 68ms
memory: 26812kb
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:
1000000000
result:
wrong answer 1st numbers differ - expected: '200001000000000', found: '1000000000'