GitHub - Rishi-11-2/CP

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 78 Commits
Sorry, we had to truncate this directory to 1,000 files. 372 entries were omitted from the list.
Algorithms		Algorithms
CSES		CSES
.A_A_B.cpp.un~		.A_A_B.cpp.un~
.gitignore		.gitignore
3_Logicians_Walk_into_a_Bar.cpp		3_Logicians_Walk_into_a_Bar.cpp
A_-_Majority.cpp		A_-_Majority.cpp
A_-_Many_A_B_Problems.cpp		A_-_Many_A_B_Problems.cpp
A_-_Non-Adjacent_Flip.cpp		A_-_Non-Adjacent_Flip.cpp
A_-_Swap_Digit.cpp		A_-_Swap_Digit.cpp
A_-_flip.cpp		A_-_flip.cpp
A_1_Non-alternating_Deck_easy_version.cpp		A_1_Non-alternating_Deck_easy_version.cpp
A_202_s_3_s.cpp		A_202_s_3_s.cpp
A_2_Alternating_Deck_hard_version.cpp		A_2_Alternating_Deck_hard_version.cpp
A_2_K_k_knapsack.cpp		A_2_K_k_knapsack.cpp
A_321_like_Checker.cpp		A_321_like_Checker.cpp
A_3_14.cpp		A_3_14.cpp
A_A_B.cpp		A_A_B.cpp
A_A_B.cpp~		A_A_B.cpp~
A_A_Gift_From_Orangutan.cpp		A_A_Gift_From_Orangutan.cpp
A_Absolute_Maximization.cpp		A_Absolute_Maximization.cpp
A_Add_Plus_Minus_Sign.cpp		A_Add_Plus_Minus_Sign.cpp
A_Addition_and_Minimum.cpp		A_Addition_and_Minimum.cpp
A_Adjacent_Product.cpp		A_Adjacent_Product.cpp
A_Alice_and_Books.cpp		A_Alice_and_Books.cpp
A_Array_Coloring.cpp		A_Array_Coloring.cpp
A_Assignment_and_Maximal_Segment.cpp		A_Assignment_and_Maximal_Segment.cpp
A_AtCoder_Line.cpp		A_AtCoder_Line.cpp
A_Attack.cpp		A_Attack.cpp
A_Bazoka_and_Mocha_s_Array.cpp		A_Bazoka_and_Mocha_s_Array.cpp
A_Bear_and_Prime_100.cpp		A_Bear_and_Prime_100.cpp
A_Beautiful_Sequence.cpp		A_Beautiful_Sequence.cpp
A_Binary_Imbalance.cpp		A_Binary_Imbalance.cpp
A_CAPS_LOCK.cpp		A_CAPS_LOCK.cpp
A_Candy_Button.cpp		A_Candy_Button.cpp
A_Catch_the_Coin.cpp		A_Catch_the_Coin.cpp
A_Central_Location.cpp		A_Central_Location.cpp
A_Challenging_Valleys.cpp		A_Challenging_Valleys.cpp
A_Channel.cpp		A_Channel.cpp
A_Chat_room.cpp		A_Chat_room.cpp
A_Chord.cpp		A_Chord.cpp
A_Christmas_Present.cpp		A_Christmas_Present.cpp
A_Cipher_Shifer.cpp		A_Cipher_Shifer.cpp
A_Circuit.cpp		A_Circuit.cpp
A_Closest_Point.cpp		A_Closest_Point.cpp
A_Coins.cpp		A_Coins.cpp
A_Costly_Permutation.cpp		A_Costly_Permutation.cpp
A_Count_Takahashi.cpp		A_Count_Takahashi.cpp
A_Counting_Beauty_Factor.cpp		A_Counting_Beauty_Factor.cpp
A_Cut_the_Triangle.cpp		A_Cut_the_Triangle.cpp
A_Cut_the_Triangle.exe		A_Cut_the_Triangle.exe
A_DSU_with_rollback.cpp		A_DSU_with_rollback.cpp
A_Desorting.cpp		A_Desorting.cpp
A_Destroyer.cpp		A_Destroyer.cpp
A_Diagonals.cpp		A_Diagonals.cpp
A_Disjoint_Sets_Union.cpp		A_Disjoint_Sets_Union.cpp
A_Distanced_Coloring.cpp		A_Distanced_Coloring.cpp
A_Diverse_Game.cpp		A_Diverse_Game.cpp
A_Divisible.cpp		A_Divisible.cpp
A_Divisible_Array.cpp		A_Divisible_Array.cpp
A_Dual_Trigger.cpp		A_Dual_Trigger.cpp
A_Duff_and_Weight_Lifting.cpp		A_Duff_and_Weight_Lifting.cpp
A_Easy_Problem.cpp		A_Easy_Problem.cpp
A_Echo.cpp		A_Echo.cpp
A_Ela_Sorting_Books.cpp		A_Ela_Sorting_Books.cpp
A_Election_2.cpp		A_Election_2.cpp
A_Entertainment_in_MAC.cpp		A_Entertainment_in_MAC.cpp
A_Escalator_Conversations.cpp		A_Escalator_Conversations.cpp
A_Everybody_Likes_Good_Arrays.cpp		A_Everybody_Likes_Good_Arrays.cpp
A_Exponential_Plant.cpp		A_Exponential_Plant.cpp
A_Extra_terrestrial_Intelligence.cpp		A_Extra_terrestrial_Intelligence.cpp
A_Factorise_N_M.cpp		A_Factorise_N_M.cpp
A_Fair.cpp		A_Fair.cpp
A_Farmer_John_s_Challenge.cpp		A_Farmer_John_s_Challenge.cpp
A_Find_Minimum_Operations.cpp		A_Find_Minimum_Operations.cpp
A_Fire_Nation_s_Fury.cpp		A_Fire_Nation_s_Fury.cpp
A_First_ABC.cpp		A_First_ABC.cpp
A_First_ABC_2.cpp		A_First_ABC_2.cpp
A_First_Player.cpp		A_First_Player.cpp
A_Forbidden_Integer.cpp		A_Forbidden_Integer.cpp
A_Forked.cpp		A_Forked.cpp
A_Full_Moon.cpp		A_Full_Moon.cpp
A_GamingForces.cpp		A_GamingForces.cpp
A_Garland.cpp		A_Garland.cpp
A_Get_together.cpp		A_Get_together.cpp
A_Gift_Carpet.cpp		A_Gift_Carpet.cpp
A_Glutton_Takahashi.cpp		A_Glutton_Takahashi.cpp
A_Goals_of_Victory.cpp		A_Goals_of_Victory.cpp
A_Grasshopper_on_a_Line.cpp		A_Grasshopper_on_a_Line.cpp
A_Greatest_Convex.cpp		A_Greatest_Convex.cpp
A_Greg_and_Array.cpp		A_Greg_and_Array.cpp
A_Guess_the_Maximum.cpp		A_Guess_the_Maximum.cpp
A_Hall_of_Fame.cpp		A_Hall_of_Fame.cpp
A_Hongcow_Builds_A_Nation.cpp		A_Hongcow_Builds_A_Nation.cpp
A_Hossam_and_Combinatorics.cpp		A_Hossam_and_Combinatorics.cpp
A_Increasing_Sequence.cpp		A_Increasing_Sequence.cpp
A_Increasing_and_Decreasing.cpp		A_Increasing_and_Decreasing.cpp
A_Iris_and_Game_on_the_Tree.cpp		A_Iris_and_Game_on_the_Tree.cpp
A_Jiro.cpp		A_Jiro.cpp
A_Joey_Takes_Money.cpp		A_Joey_Takes_Money.cpp
A_Koxia_and_Whiteboards.cpp		A_Koxia_and_Whiteboards.cpp

Repository files navigation

#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
void solve();
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}
void solve()
{
    int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    int arr[n];
    int prefix[n + 1];
    for (int i = 0; i < n; i++)
    {
        arr[i] = (s[i] - '0');
    }
    prefix[1] = arr[0];
    prefix[0] = 0;
    for (int i = 2; i <= n; i++)
    {
        prefix[i] = prefix[i - 1] + arr[i - 1];
    }
    // cout << "hi" << endl;
    int res = 1;
    // for (int i = 0; i <= n; i++)
    //     cout << prefix[i] << " ";
    // cout << endl;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        cin >> x >> y;
        if (x == y)
            continue;
        int r = y - x + 1;
        int a = r - (prefix[y] - prefix[x - 1]);
        cout << a << " " << r << endl;
        if (prefix[x + a] - prefix[x] != 0)
            res++;
    }
    // if (n == 1)
    // {
    //     cout << 1 << endl;
    //     return;
    // }
    cout << res << endl;
}