QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#516944 | #8783. Cherry Picking | SocialPanda | WA | 0ms | 3816kb | C++23 | 1.2kb | 2024-08-13 00:48:30 | 2024-08-13 00:48:31 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;
int a[N];
string s;
int n,k;
bool check(int num)
{
int cnt=0;
char pre='.';
for(int i=1;i<=n;i++)
{
if(a[i]<num) continue;
//cout<<s[i]<<'!'<<endl;
if(s[i]=='1') cnt++;
else cnt=0;
if(cnt>=k) return true;
pre=s[i];
}
return false;
}
void solve()
{
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
cin>>s;s=' '+s;
int ll=0,rr=n;
//cout<<check(0)<<endl;
while(ll<rr)
{
int mid=ll+rr+1>>1;
if(check(mid)) ll=mid;
else rr=mid-1;
}
cout<<ll<<endl;
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt=1;
//cin >> tt;
while(tt--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3816kb
input:
5 2 1 2 3 4 5 01101
output:
2
result:
ok answer is '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
5 2 3 4 5 2 1 10101
output:
0
result:
ok answer is '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
1 1 1 1
output:
1
result:
ok answer is '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
1 1 1 0
output:
0
result:
ok answer is '0'
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 3544kb
input:
5 3 8 3 5 2 7 10101
output:
0
result:
wrong answer expected '5', found '0'