Submission #12978457

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define step(i, s, n, d) for(int i=s; i<n; i+=d)
#define FOR(i,s,n) step(i,s,n,1)
#define rep(i,n) FOR(i,0,n)
#define ll long long
typedef pair<int, int> P;

int main(){
  ll one, zero = 0;
  string s;
  cin >> s;
  rep(i, s.size()) {
    if (s[i] == '0') {
      zero++;
    } else {
      one++;
    }
  }
  cout << min(one, zero) * 2<< endl;
}

Submission Info

Submission Time
Task C - Unification
User KeitaKishida0811
Language C++14 (GCC 5.4.1)
Score 300
Code Size 413 Byte
Status AC
Exec Time 5 ms
Memory 512 KiB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 20
AC × 3
Set Name Test Cases
All corner_1, corner_2, corner_3, corner_4, corner_5, corner_6, min_1, min_2, one_1, one_2, random_1, random_2, random_3, random_4, random_5, sample_01, sample_02, sample_03, zero_1, zero_2
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
corner_1 AC 5 ms 512 KiB
corner_2 AC 5 ms 512 KiB
corner_3 AC 5 ms 512 KiB
corner_4 AC 5 ms 512 KiB
corner_5 AC 5 ms 512 KiB
corner_6 AC 5 ms 512 KiB
min_1 AC 1 ms 256 KiB
min_2 AC 1 ms 256 KiB
one_1 AC 5 ms 512 KiB
one_2 AC 5 ms 512 KiB
random_1 AC 1 ms 256 KiB
random_2 AC 1 ms 256 KiB
random_3 AC 5 ms 512 KiB
random_4 AC 4 ms 384 KiB
random_5 AC 5 ms 512 KiB
sample_01 AC 1 ms 256 KiB
sample_02 AC 1 ms 256 KiB
sample_03 AC 1 ms 256 KiB
zero_1 AC 4 ms 512 KiB
zero_2 AC 5 ms 512 KiB