QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#273170 | #7880. Streak Manipulation | ucup-team112# | AC ✓ | 148ms | 16132kb | C++20 | 10.1kb | 2023-12-02 21:48:46 | 2023-12-02 21:48:47 |
Judging History
answer
//#define _GLIBCXX_DEBUG
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug_print.hpp>
#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define OUT(...) (static_cast<void>(0))
#endif
#define endl '\n'
#define lfs cout<<fixed<<setprecision(15)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
auto tmp = v;
for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
rearrange(ord, head);
rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
vector<T>inv(ord.size());
for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
namespace converter{
int dict[500];
const string lower="abcdefghijklmnopqrstuvwxyz";
const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string digit="0123456789";
const string digit1="123456789";
void regi_str(const string &t){
for(int i=0;i<t.size();i++){
dict[t[i]]=i;
}
}
void regi_int(const string &t){
for(int i=0;i<t.size();i++){
dict[i]=t[i];
}
}
vector<int>to_int(const string &s,const string &t){
regi_str(t);
vector<int>ret(s.size());
for(int i=0;i<s.size();i++){
ret[i]=dict[s[i]];
}
return ret;
}
vector<int>to_int(const string &s){
auto t=s;
sort(t.begin(),t.end());
t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
vector<vector<int>>to_int(const vector<string>&s,const string &t){
regi_str(t);
vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));
for(int i=0;i<s.size();i++){
for(int j=0;j<s[0].size();j++){
ret[i][j]=dict[s[i][j]];
}
}
return ret;
}
vector<vector<int>>to_int(const vector<string>&s){
string t;
for(int i=0;i<s.size();i++){
t+=s[i];
}
sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
string to_str(const vector<int>&s,const string &t){
regi_int(t);
string ret;
for(auto z:s)ret+=dict[z];
return ret;
}
vector<string> to_str(const vector<vector<int>>&s,const string &t){
regi_int(t);
vector<string>ret(s.size());
for(int i=0;i<s.size();i++){
for(auto z:s[i])ret[i]+=dict[z];
}
return ret;
}
}
template< typename T = int >
struct edge {
int to;
T cost;
int id;
edge():to(-1),id(-1){};
edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
operator int() const { return to; }
};
template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
Graph<T>ret(g.size());
for(int i=0;i<g.size();i++){
for(auto e:g[i]){
int to = e.to;
e.to = i;
ret[to].push_back(e);
}
}
return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
Graph<T> ret(n);
for(int es = 0; es < m; es++){
int u,v;
T w=1;
cin>>u>>v;u-=indexed,v-=indexed;
if(weighted)cin>>w;
ret[u].emplace_back(v,w,es);
if(!directed)ret[v].emplace_back(u,w,es);
}
return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
Graph<T>ret(n);
for(int i=1;i<n;i++){
int p;cin>>p;
p-=indexed;
ret[p].emplace_back(i);
if(!directed)ret[i].emplace_back(p);
}
return ret;
}
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
ll res=0,buf=0;
bool judge = true;
int n,m,k;cin>>n>>m>>k;
string s;cin>>s;
vector<int>cs(n+1),end(n+1,n+1);
rep(i,0,n)cs[i+1]=cs[i]+(s[i]=='0');
rrep(i,0,n){
if(i<n-1&&s[i+1]=='0')end[i]=i+2;
else end[i]=end[i+1];
}
int ok=0,ng=n+1;
OUT(end);
while(ng-ok>=2){
int mid=(ok+ng)/2;
auto dp=vec(n+1,k+1,m+1);
dp[0][0]=0;
rep(i,0,n){
rep(j,0,k+1){
chmin(dp[i+1][j],dp[i][j]);
if(i+mid<=n&&j+1<=k){
int r=end[i+mid-1];
chmin(dp[min(n,r)][j+1],dp[i][j]+cs[r-1]-cs[i]);
}
}
}
//OUT(mid,dp);
if(dp[n][k]<=m)ok=mid;
else ng=mid;
}
if(ok==0)ok=-1;
cout<<ok<<endl;
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
8 3 2 10110110
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
12 3 3 100100010011
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
4 4 4 0000
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
1000 200 5 0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...
output:
99
result:
ok 1 number(s): "99"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
1000 200 5 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
40
result:
ok 1 number(s): "40"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
1000 200 5 1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
-1
result:
ok 1 number(s): "-1"
Test #7:
score: 0
Accepted
time: 111ms
memory: 15964kb
input:
200000 5 3 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2
result:
ok 1 number(s): "2"
Test #8:
score: 0
Accepted
time: 127ms
memory: 15900kb
input:
200000 5 2 0001010000000000000000010011000001000000000000000001100000000001000000000000010011000010000000000110000010000010000100000000001001010000011000100000000001001000000000011110000100000011000000100110100110001011000000000000000000000000110001000000100000011100010011010001010010010100000000000...
output:
13
result:
ok 1 number(s): "13"
Test #9:
score: 0
Accepted
time: 147ms
memory: 15904kb
input:
200000 5 5 0001100001100000001011100010111101100100110001000011001011111101110100000000000111101001110100010101010100110100100011001100000010110111110010111011110100100101011001100101001010110100011101011001000101011110110010001011111101011101011010101101010001111110101001001110000000000010101001001...
output:
17
result:
ok 1 number(s): "17"
Test #10:
score: 0
Accepted
time: 123ms
memory: 15896kb
input:
200000 5 5 1011101011100110010111011011101110111111101111110111101111011110110111111101111011110101101110001100111110010101111011111101111111111111110110111111111011111111111111111111111111011100101111001110011100111100001111111111110101111011110010111001101111111111110110010101100111111111111111011...
output:
45
result:
ok 1 number(s): "45"
Test #11:
score: 0
Accepted
time: 134ms
memory: 15888kb
input:
200000 5 4 1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
24879
result:
ok 1 number(s): "24879"
Test #12:
score: 0
Accepted
time: 127ms
memory: 15888kb
input:
200000 5 5 1010101010010101001010100101011010110010100101000010100101010101001010110101010101010101101010110101010101010101011001010101010101010101011001010101010100010101010010101000101001010101010110010101010110101101010111101010110101010101010010101010110111010010110111011010101010101110111001101...
output:
9
result:
ok 1 number(s): "9"
Test #13:
score: 0
Accepted
time: 92ms
memory: 15988kb
input:
200000 5 1 1001001011010101010101010101110101010100101001001010101101110101011010110101010110101010101011010101010101010010101010101000100110111110101101010101101011010101010101011010101010101010101010010101010101010110101001010101010101010110101010101010101011011010001010101011010101010101010101001...
output:
20
result:
ok 1 number(s): "20"
Test #14:
score: 0
Accepted
time: 124ms
memory: 15892kb
input:
200000 5 5 0001000000001111111100001000000000111100000111111100000000000011111000011110000000111001111100110000000000000000110000000000000000000011111111100000000111001111111111100000000011100000000010000111100111110000000111111110001111110111001100111111111001011111110111000111111111111111111111111...
output:
50
result:
ok 1 number(s): "50"
Test #15:
score: 0
Accepted
time: 103ms
memory: 15824kb
input:
200000 5 4 0111111111111111111101100000111111100101011111110000000111111110010011111111111101111111110000001001111111111111111110001111111111111111111111111111111111111111111101110110000000000111111111111001101111111111010000111111110000011000111100001111111110101111111101100000011101000111111111111...
output:
90
result:
ok 1 number(s): "90"
Test #16:
score: 0
Accepted
time: 134ms
memory: 15936kb
input:
200000 5 4 0000100000110000000111100000000000111111100011111110001001110000000000001000000001100000011110000000010000000000011110000111111111101110000000100000000111100000011000011111001001000000000011000100000000000000001110000001000010000000000011111000000000000000000100000000011000000000000000000...
output:
22
result:
ok 1 number(s): "22"
Test #17:
score: 0
Accepted
time: 126ms
memory: 15936kb
input:
200000 170 3 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
57
result:
ok 1 number(s): "57"
Test #18:
score: 0
Accepted
time: 111ms
memory: 15912kb
input:
200000 170 2 00000000000000011000001010110010100000001010100001010010100011010110101100010100100010000001010000010000001000001010111100000101000110010000000010100000000100100010000000000110001000000001000101000010100000000000010100101100100011000100100000000010000101001010000000010000110000000000000...
output:
143
result:
ok 1 number(s): "143"
Test #19:
score: 0
Accepted
time: 123ms
memory: 15884kb
input:
200000 170 5 00000000110010110001010110100010110110100111110011111010101001111011101011111011101010100000001100110100000011000110001100000111011111001011001101011111111011101010100111001100011010100100001100010000001010010101011100001010111100011100101110111001110101011011100011100010010011001000100...
output:
107
result:
ok 1 number(s): "107"
Test #20:
score: 0
Accepted
time: 127ms
memory: 16076kb
input:
200000 170 5 10110010111110111011101101110111110111111011111110011111010111111111010100111001010111111111111001111011011011111111101011111011111111111010111111100111001001111100010111111001111011111011101100101110010101111101101011111101110011111110010001111101101101011110110111011111101010010111111...
output:
225
result:
ok 1 number(s): "225"
Test #21:
score: 0
Accepted
time: 120ms
memory: 16056kb
input:
200000 170 4 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
44639
result:
ok 1 number(s): "44639"
Test #22:
score: 0
Accepted
time: 135ms
memory: 15948kb
input:
200000 170 5 10101011010101100101010101000101010110010101010010101001010101101001010110101001010010101010101010101011010101010010100101101110101010101001010101101100101010101101011010101010101010100110101110110101101100100101010101000110101010101001010101111010101010101000100101010101010101010101010...
output:
85
result:
ok 1 number(s): "85"
Test #23:
score: 0
Accepted
time: 95ms
memory: 16048kb
input:
200000 170 1 00101101010101011010101101010100100100110111110010100100110110101010100110101010011010101011101001101010101011101010010101010100101100101010110101001010101101101010101010001010010110100010110101010110101110101001010010010101101010100010101011001010101000010101110010110101010101101101010...
output:
371
result:
ok 1 number(s): "371"
Test #24:
score: 0
Accepted
time: 146ms
memory: 16044kb
input:
200000 170 5 00111111100111111100000000011100111000000001110000000000101111111110000111111000000001111111111111111100010000111000000001111101111110001111000001111100000000111111100011111111111111111111110110000000000111111111111111100000001111111111111110000111111011111000001111111111100001111111100...
output:
174
result:
ok 1 number(s): "174"
Test #25:
score: 0
Accepted
time: 142ms
memory: 15908kb
input:
200000 170 4 00100101111111111110000111111000001111111111111111111111001000011111111001110011111111111100001111111111111110111111111111111111111111011110001111100111111111111111111111111111011101111111111110011111111111111000011101111101101111100001111111111111111011110001111111111111001111111000001...
output:
342
result:
ok 1 number(s): "342"
Test #26:
score: 0
Accepted
time: 127ms
memory: 15996kb
input:
200000 170 4 00000111111111000000010000000000111000100110000000110000000000011000000111100000000110000000000000011100000000000111111100000010010000001000000000000000000000000000000000000000000011000110000000000000010000000000000000000000000000000000011100000000110000000000010000000000000000111111000...
output:
98
result:
ok 1 number(s): "98"
Test #27:
score: 0
Accepted
time: 130ms
memory: 16076kb
input:
200000 5780 3 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
1928
result:
ok 1 number(s): "1928"
Test #28:
score: 0
Accepted
time: 79ms
memory: 15956kb
input:
200000 5780 2 0000001000000000011010000000000000100110101010000011011010000000000100011001001001001010100010100001100100000000010010010000000000000001010001001000000011000001000110000000000001001000110110010100001001110010000000010010000100011000001010110000001001000001010001000000100011000000100000...
output:
3962
result:
ok 1 number(s): "3962"
Test #29:
score: 0
Accepted
time: 132ms
memory: 16132kb
input:
200000 5780 5 1110111001110010111101101000110001011010111111011011110101000101010001101110111111001100001011110010110000011011110100110100011001010110010011000011110101011101000111001111001000001001101001111001110000011001010001110101011000010101000011001011000010110010001001010111010111001001011101...
output:
2436
result:
ok 1 number(s): "2436"
Test #30:
score: 0
Accepted
time: 137ms
memory: 15928kb
input:
200000 5780 5 1101110011001101101110011100111101101111001011111101010101111100111010111111101111111101011110100111001111111110110111101100111111111111111111111011011111110101111111001111111110110111011111111111110001110101111110011111111100110010101111110111010111110110110110011101111110111101111111...
output:
4936
result:
ok 1 number(s): "4936"
Test #31:
score: 0
Accepted
time: 110ms
memory: 16076kb
input:
200000 5780 4 1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
36897
result:
ok 1 number(s): "36897"
Test #32:
score: 0
Accepted
time: 145ms
memory: 15876kb
input:
200000 5780 5 1101011101010101010101010101010101011010101010101101010110101010110101010101101101010100111001010101010101000101010010100010100101010101010100101101010101011011001001101011011010101011001001001010110110101010101010100010110110100011010010101101010010101010101011010101010101010101011010...
output:
2372
result:
ok 1 number(s): "2372"
Test #33:
score: 0
Accepted
time: 119ms
memory: 16104kb
input:
200000 5780 1 1010101101010100111010101011110010110101010111010101010101010101101000101011001010110101011010101111101101000010100100101101010101001001010110010101001010011010101010101110101000110101010101010101011010100110101010100101010101101001011011010100100110100100101010101001010101010110101101...
output:
11661
result:
ok 1 number(s): "11661"
Test #34:
score: 0
Accepted
time: 143ms
memory: 15964kb
input:
200000 5780 5 0000111110001111111111111111111000000111111111100000000011111111111100011100011100000000000000000111000001111110000000111111110000000011100001111111111111100000000000000011100000001100011111011110100011111001111111110000000001111110011111111111111111001110000000000000000001000000000000...
output:
2622
result:
ok 1 number(s): "2622"
Test #35:
score: 0
Accepted
time: 148ms
memory: 16000kb
input:
200000 5780 4 1111111000100111111111111101001101111111111110111111100001101111100010101111110001111111111110011111111111111111110011111111100011110001111101111111111111111111111111111111111110011111111110000001100011111111111111111111111111111111101111111111111000001111111111111111110011011111110000...
output:
6266
result:
ok 1 number(s): "6266"
Test #36:
score: 0
Accepted
time: 124ms
memory: 15840kb
input:
200000 5780 4 0000000000010000101111110001000001111111000000001100000000101111111111011101111110011111000000000011110000000000000000001000110000000000000000000000000000111001111100000000000000100000010000000000001100000000001111111100000000000111100100000111000001100000000000010000000010000011110000...
output:
2083
result:
ok 1 number(s): "2083"
Test #37:
score: 0
Accepted
time: 99ms
memory: 15988kb
input:
200000 196520 3 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
65514
result:
ok 1 number(s): "65514"
Test #38:
score: 0
Accepted
time: 123ms
memory: 15932kb
input:
200000 196520 2 00101100000000000100000000110000000000000010110010000000100000001001001000000000000000010100101000000101000000100000000000001010100011000100000100000000000001001000000000011100010010001000001000100100000000000101000100001100000000000000110000000000000000010000000000100000000001101000...
output:
99999
result:
ok 1 number(s): "99999"
Test #39:
score: 0
Accepted
time: 120ms
memory: 15900kb
input:
200000 196520 5 01101011111001100101110100100001001101001111101101001000101011111100011000001100001001001101111001100000110100010001100110001001111010011110101010010000111101001000101110001111010010001110100101110100011001111110000111001011001101011000101010100101011001000111100001001101100010100101...
output:
39998
result:
ok 1 number(s): "39998"
Test #40:
score: 0
Accepted
time: 139ms
memory: 15932kb
input:
200000 196520 5 11111011110001111110111110110110011011111010011111010111001111101000101011111111101111110110111111111111111111001010111111000111111111110111101011111001101111110110001111101011101101110011110010111010110011110111111011011000010100111011101101110111111001000000110111111100011011001100...
output:
39998
result:
ok 1 number(s): "39998"
Test #41:
score: 0
Accepted
time: 103ms
memory: 15988kb
input:
200000 196520 4 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
41481
result:
ok 1 number(s): "41481"
Test #42:
score: 0
Accepted
time: 134ms
memory: 15884kb
input:
200000 196520 5 10101101101010110101011101010100101010101010100101010100110101010010101000101010101010101010110101010101001101010110101101010101010110101100010101010101010101010101010101011010010101010100100101010101001010101010100100111001101010101101010100101011101010101010101010101010101010101010...
output:
39998
result:
ok 1 number(s): "39998"
Test #43:
score: 0
Accepted
time: 99ms
memory: 16048kb
input:
200000 196520 1 01010010101010001101010101010101010101001010100110110101010101010010110100101010101101010101010101010011011101010100110101101011101010101101010110101001010101011101011010100101001010101011010101001101010110101011011010101010100101010101001010110101010101101010101010100101010101001010...
output:
200000
result:
ok 1 number(s): "200000"
Test #44:
score: 0
Accepted
time: 121ms
memory: 15932kb
input:
200000 196520 5 00001111101000111111011110011111100111000000000000000000111111000000000000011110000000000000000011111110000011100011000000000111001111111000000001001111010100001111111111111101111100000000000001100000000000111000011111111110001111111110000000000011100000000000100011111111110000001110...
output:
39995
result:
ok 1 number(s): "39995"
Test #45:
score: 0
Accepted
time: 115ms
memory: 15936kb
input:
200000 196520 4 01110000001001111111000000011001000000011111111111001100000001000000110000111111111111110011111111111000000000001111111111011111111111111111110011111111000001000011111111111111111011111100111101111111111111111111111111001111001011100111100111111111111110111001111100011111100001111111...
output:
49993
result:
ok 1 number(s): "49993"
Test #46:
score: 0
Accepted
time: 128ms
memory: 16072kb
input:
200000 196520 4 01000000001100000001100000000000000000011000001011110000000000001000000110000000000000000000000000000000000000000010000111111110000000011100000000000011000000000000001101100000000000000000000000000000000111110000000000000000000011111000000000110100000000111110000001111111111111000000...
output:
49998
result:
ok 1 number(s): "49998"
Extra Test:
score: 0
Extra Test Passed