(cache)Submission #66346022 - AtCoder Beginner Contest 408

Contest Duration: 2025-05-31(Sat) 21:00 - 2025-05-31(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #66346022

Source Code Expand

Copy

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;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while(T--){
        int N;
        string S;
        cin >> N >> S;
        vector<ll> P(N+1);
        for(int i = 1; i <= N; i++){
            P[i] = P[i-1] + (S[i-1] == '1');
        }
        ll bestA = LLONG_MAX, mn = LLONG_MAX;
        for(int r = 1; r <= N+1; r++){
            ll Pr1 = P[r-1];
            ll A = 2*Pr1 - r;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while(T--){
        int N;
        string S;
        cin >> N >> S;
        vector<ll> P(N+1);
        for(int i = 1; i <= N; i++){
            P[i] = P[i-1] + (S[i-1] == '1');
        }
        ll bestA = LLONG_MAX, mn = LLONG_MAX;
        for(int r = 1; r <= N+1; r++){
            ll Pr1 = P[r-1];
            ll A = 2*Pr1 - r;
            if(A < bestA) bestA = A;
            ll B = r - 2*Pr1;
            mn = min(mn, bestA + B);
        }
        cout << P[N] + mn << "\n";
    }
    return 0;
}

Submission Info

Submission Time	2025-05-31 21:58:32
Task	D - Flip to Gather
User	OYU__0YU
Language	C++ 20 (gcc 12.2)
Score	400
Code Size	694 Byte
Status	AC
Exec Time	4 ms
Memory	5140 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

400 / 400

Status

× 2

× 30

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt
All	00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	1 ms	3500 KiB
00_sample_01.txt	AC	1 ms	3508 KiB
01_test_00.txt	AC	4 ms	3460 KiB
01_test_01.txt	AC	4 ms	3584 KiB
01_test_02.txt	AC	3 ms	3524 KiB
01_test_03.txt	AC	3 ms	3524 KiB
01_test_04.txt	AC	3 ms	3528 KiB
01_test_05.txt	AC	4 ms	3500 KiB
01_test_06.txt	AC	4 ms	3516 KiB
01_test_07.txt	AC	4 ms	3440 KiB
01_test_08.txt	AC	4 ms	3392 KiB
01_test_09.txt	AC	3 ms	3596 KiB
01_test_10.txt	AC	2 ms	3548 KiB
01_test_11.txt	AC	2 ms	3548 KiB
01_test_12.txt	AC	2 ms	3536 KiB
01_test_13.txt	AC	2 ms	3560 KiB
01_test_14.txt	AC	2 ms	3560 KiB
01_test_15.txt	AC	2 ms	3640 KiB
01_test_16.txt	AC	2 ms	3684 KiB
01_test_17.txt	AC	2 ms	3472 KiB
01_test_18.txt	AC	2 ms	3564 KiB
01_test_19.txt	AC	3 ms	4508 KiB
01_test_20.txt	AC	2 ms	4412 KiB
01_test_21.txt	AC	2 ms	4564 KiB
01_test_22.txt	AC	2 ms	5052 KiB
01_test_23.txt	AC	2 ms	4944 KiB
01_test_24.txt	AC	2 ms	5140 KiB
01_test_25.txt	AC	2 ms	5060 KiB
01_test_26.txt	AC	2 ms	5076 KiB
01_test_27.txt	AC	2 ms	4944 KiB