1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include<bits/stdc++.h>
using namespace std;
bool poop(const long long& a, const long long& b){
	return abs(a)>abs(b);
}
int main(){
	long long t;
	cin >> t;
	for(long long ii = 0; ii < t; ii++){
		long long n;
		cin >> n;
		long long a[n];
		long long fin = 0;
		for(long long i = 0 ; i < n; i++){
			char temp;
			cin >> temp;
			a[i]=temp-48;
			if(a[i]) fin++;
		}
		long long temp2=0, temp3=0;
		vector<long long> b;
		long long m = -1;
		for(long long i = 0 ; i < n; i++){
			if(a[i]){
				if(i>0&&!a[i-1]){
					b.push_back(temp2*m);
					if(m==-1) m=1;
				}
				temp2=0;
			}else{
				temp2++;
				if(i==n-1){
					b.push_back(0-temp2);
				}
			}
		}
		sort(b.begin(), b.end(), poop);
		long long time = 0;
		for(long long i = 0; i < b.size(); i++){
			if(b[i]>0){
				if(b[i]>=time*2+1){
					if(b[i]==time*2+1){
						fin+=time*2;
						time++;
					}else{
						fin+=time*2+1;
						time+=2;
					}
				}else{
					fin+=b[i];
				}
			}else{
				if(b[i]*-1>time){
					fin+=time;
					time++;
				}else{
					fin+=b[i]*-1;
				}
			}
		}
		cout << fin << '\n';
	}
}