Submission #62788413

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for(ll i=0; i<n; i++)
#define srep(i, s, n) for(ll i=s; (s<=n ? i<n : i>n); i+=(s<=n)*2-1)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vout(v) {for(auto x: v){cout << x << " ";} cout << endl;}
ll INF = 9223372036800000000;
int inf = 1<<30;
template <typename A = string,
typename B = string, 
typename C = string, 
typename D = string, 
typename E = string>
void dout(A a = "", B b = "", C c = "", D d = "", E e = ""){
    cout << a << " " << b << " " << c << " " << d << " " << e << endl;
    return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, n) for(ll i=0; i<n; i++)
#define srep(i, s, n) for(ll i=s; (s<=n ? i<n : i>n); i+=(s<=n)*2-1)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vout(v) {for(auto x: v){cout << x << " ";} cout << endl;}
ll INF = 9223372036800000000;
int inf = 1<<30;

template <typename A = string,
typename B = string, 
typename C = string, 
typename D = string, 
typename E = string>
void dout(A a = "", B b = "", C c = "", D d = "", E e = ""){
    cout << a << " " << b << " " << c << " " << d << " " << e << endl;
    return;
}

int main(){
    ll n; cin >> n;
    string s; cin >> s;
    ll cnt_sm = 0;
    ll cnt = 0;
    ll mid = 0;
    rep(i, n){
        if(s[i] == '1') cnt_sm++;
    }
    rep(i, n){
        if(s[i] == '1'){
            cnt++;
            if(cnt == cnt_sm/2+1){
                mid = i;
            }
        }
    }
    
    cnt = 0;
    ll ans = 0;
    //dout(mid, cnt_sm);
    rep(i, n){
        if(s[i] == '1'){
            cnt++;
            if(cnt < cnt_sm/2+1){
                ans += mid-i-cnt;
            } else if(cnt > cnt_sm/2+1){
                ans += i-mid-(cnt-(cnt_sm/2+1));
            }
            //dout(i, ":", ans);
        }
    }
    dout(ans);
    
    
}

Submission Info

Judge Result