QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#474484#8832. Daily Disinfectionucup-team866WA 3ms3892kbC++14437b2024-07-12 19:08:052024-07-12 19:08:05

Judging History

This is the latest submission verdict.

  • [2024-07-12 19:08:05]
  • Judged
  • Verdict: WA
  • Time: 3ms
  • Memory: 3892kb
Show
  • [2024-07-12 19:08:05]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
int T, n, c, t, f, mn; char s[1000005];
int main() {
	cin >> T;
	while (T --) {
		scanf ("%d%s", &n, s+1), c = t = f = 0, mn = n;
		for (int i=1; i<=n; i++) {
			if (s[i] == '1') c ++, t ++;
			else if (t) mn = max(mn, t), t = 0;
			f |= s[i] == '0' && s[i+1] == '0';
		} if (t) mn = min(mn, t);
		if (s[1] == '1' && s[n] == '1' && ! f)
			c += mn;
		printf ("%d\n", c);
	}
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3892kb

input:

3
2
01
5
00110
9
101010101

output:

1
2
6

result:

ok 3 number(s): "1 2 6"

Test #2:

score: -100
Wrong Answer
time: 3ms
memory: 3764kb

input:

10000
15
010111111011011
10
1000101111
10
0011111101
1
0
3
110
4
1000
8
10000111
20
00000101000100001110
13
1101110110110
13
0111100011010
17
00001001111110101
1
0
20
10001010011000111100
11
00100110101
11
10110101000
15
001011110011000
16
1110111110000111
15
011110110110010
1
0
20
10110001101100010...

output:

11
6
7
0
2
1
4
6
9
7
9
0
9
5
5
7
11
9
0
9
8
7
3
6
0
6
2
5
4
8
10
4
6
1
7
2
1
8
1
11
11
9
13
4
11
13
22
6
5
4
5
1
1
7
7
5
3
0
0
11
8
5
6
7
6
4
9
1
4
5
12
0
2
10
4
3
7
7
3
7
4
3
7
9
15
2
6
6
9
8
6
1
2
6
2
11
10
5
0
0
4
7
4
7
0
4
7
9
3
3
10
3
6
11
8
1
8
6
5
2
4
9
7
1
5
7
8
3
5
11
6
10
8
8
9
16
2
7
6
5
...

result:

wrong answer 40th numbers differ - expected: '8', found: '11'
English 繁體中文 简体中文

Server Time: 2025-03-13 16:29:00 | OpenSource Project