GitHub - RafaelChavesPB/CompetitiveProgramming: Soluções para problemas de programação competitiva disponiveis nas plataformas codeforces, cses, beecrowd(uri), neps academy, kattis e online judge.

Repository navigation

CompetitiveProgramming

Public

About

Soluções para problemas de programação competitiva disponiveis nas plataformas codeforces, cses, beecrowd(uri), neps academy, kattis e online judge.

competitive-programming cpp python

License

Activity

1 star

1 watching

Name		Name	Last commit message	Last commit date
.gitignore		.gitignore
code_jam_appendSort--.cpp		code_jam_appendSort--.cpp
code_jam_appendSort.cpp		code_jam_appendSort.cpp
code_jam_brokenClock.cpp		code_jam_brokenClock.cpp
code_jam_hackerExam.cpp		code_jam_hackerExam.cpp
code_jam_primeTime++.cpp		code_jam_primeTime++.cpp
code_jam_primeTime--.cpp		code_jam_primeTime--.cpp
code_jam_primeTime.cpp		code_jam_primeTime.cpp
codeforces_3_palindrome.cpp		codeforces_3_palindrome.cpp
codeforces_Alice_bob_and_candies.cpp		codeforces_Alice_bob_and_candies.cpp
codeforces_Alt_Binary_string_to_subsequences.cpp		codeforces_Alt_Binary_string_to_subsequences.cpp
codeforces_Ant_colony.cpp		codeforces_Ant_colony.cpp
codeforces_Anton_and_Letters.cpp		codeforces_Anton_and_Letters.cpp
codeforces_Applejack_and_storage2.cpp		codeforces_Applejack_and_storage2.cpp
codeforces_Applejack_and_storages.cpp		codeforces_Applejack_and_storages.cpp
codeforces_Array.cpp		codeforces_Array.cpp
codeforces_Arrival_of_the_general.cpp		codeforces_Arrival_of_the_general.cpp
codeforces_Binary_string_to_subsequences.cpp		codeforces_Binary_string_to_subsequences.cpp
codeforces_Bit++.cpp		codeforces_Bit++.cpp
codeforces_Blackjack.cpp		codeforces_Blackjack.cpp
codeforces_Boats_competition.cpp		codeforces_Boats_competition.cpp
codeforces_Books_Exchange.cpp		codeforces_Books_Exchange.cpp
codeforces_Books_exchange(1).cpp		codeforces_Books_exchange(1).cpp
codeforces_Boy_or_girl.cpp		codeforces_Boy_or_girl.cpp
codeforces_Buy_a_Shovel.cpp		codeforces_Buy_a_Shovel.cpp
codeforces_Cakeminator.cpp		codeforces_Cakeminator.cpp
codeforces_Candy_bags.cpp		codeforces_Candy_bags.cpp
codeforces_Chips.cpp		codeforces_Chips.cpp
codeforces_Choose_Two_numbers.cpp		codeforces_Choose_Two_numbers.cpp
codeforces_Comparing_Strings.cpp		codeforces_Comparing_Strings.cpp
codeforces_Copying_Data.cpp		codeforces_Copying_Data.cpp
codeforces_Cut_ribbon.cpp		codeforces_Cut_ribbon.cpp
codeforces_DZY_loves_chessboard.cpp		codeforces_DZY_loves_chessboard.cpp
codeforces_Difference_row.cpp		codeforces_Difference_row.cpp
codeforces_Dima_and_Staircase.cpp		codeforces_Dima_and_Staircase.cpp
codeforces_Distance_and_axis.cpp		codeforces_Distance_and_axis.cpp
codeforces_Distinct_Characters_Queries.cpp		codeforces_Distinct_Characters_Queries.cpp
codeforces_Distinct_Characters_Queries2.cpp		codeforces_Distinct_Characters_Queries2.cpp
codeforces_Divisibility_problem.cpp		codeforces_Divisibility_problem.cpp
codeforces_Domino.cpp		codeforces_Domino.cpp
codeforces_Dr_Evil_Underscores.cpp		codeforces_Dr_Evil_Underscores.cpp
codeforces_Dragons.cpp		codeforces_Dragons.cpp
codeforces_Dream_and_wifi.cpp		codeforces_Dream_and_wifi.cpp
codeforces_Dubstep.cpp		codeforces_Dubstep.cpp
codeforces_Dzy_loves_chemistry.cpp		codeforces_Dzy_loves_chemistry.cpp
codeforces_EEqualize_prizes_again.cpp		codeforces_EEqualize_prizes_again.cpp
codeforces_Effective_Approach.cpp		codeforces_Effective_Approach.cpp
codeforces_Enemy_is_weak.cpp		codeforces_Enemy_is_weak.cpp
codeforces_Equivalent_Strings.cpp		codeforces_Equivalent_Strings.cpp
codeforces_Extract_Numbers.cpp		codeforces_Extract_Numbers.cpp
codeforces_Fadi_And_LCM.cpp		codeforces_Fadi_And_LCM.cpp
codeforces_Far_relatives_birthday_cake.cpp		codeforces_Far_relatives_birthday_cake.cpp
codeforces_Fedor_and_new_game.cpp		codeforces_Fedor_and_new_game.cpp
codeforces_Fixed_points.cpp		codeforces_Fixed_points.cpp
codeforces_Flipping_game.cpp		codeforces_Flipping_game.cpp
codeforces_Football.cpp		codeforces_Football.cpp
codeforces_Gifts_fixing.cpp		codeforces_Gifts_fixing.cpp
codeforces_Hamburguers.cpp		codeforces_Hamburguers.cpp
codeforces_Hongcow_builds_a_nation.cpp		codeforces_Hongcow_builds_a_nation.cpp
codeforces_Hungry_sequence.cpp		codeforces_Hungry_sequence.cpp
codeforces_Insomnia_cure.cpp		codeforces_Insomnia_cure.cpp
codeforces_Jeff_and_digits.cpp		codeforces_Jeff_and_digits.cpp
codeforces_Just_Eat_It.cpp		codeforces_Just_Eat_It.cpp
codeforces_K_string.cpp		codeforces_K_string.cpp
codeforces_Kinght_Tournament.cpp		codeforces_Kinght_Tournament.cpp
codeforces_Kitahara_harukis_gift.cpp		codeforces_Kitahara_harukis_gift.cpp
codeforces_Kuriyama_mirais_stone.cpp		codeforces_Kuriyama_mirais_stone.cpp
codeforces_Learning_languages.cpp		codeforces_Learning_languages.cpp
codeforces_Levko_and_table.cpp		codeforces_Levko_and_table.cpp
codeforces_Little_Pigs_and_Wolves.cpp		codeforces_Little_Pigs_and_Wolves.cpp
codeforces_Little_dima_and_equation.cpp		codeforces_Little_dima_and_equation.cpp
codeforces_Little_elephant_and_rozdil.cpp		codeforces_Little_elephant_and_rozdil.cpp
codeforces_Lucky_sum.cpp		codeforces_Lucky_sum.cpp
codeforces_Magic_numbers.cpp		codeforces_Magic_numbers.cpp
codeforces_Mere_Array.cpp		codeforces_Mere_Array.cpp
codeforces_Mero_Playing_Zoma.cpp		codeforces_Mero_Playing_Zoma.cpp
codeforces_Moamen_and_k_subarrays.cpp		codeforces_Moamen_and_k_subarrays.cpp
codeforces_More_cowbell.cpp		codeforces_More_cowbell.cpp
codeforces_Mr_Kiitayutas_colorful_graph.cpp		codeforces_Mr_Kiitayutas_colorful_graph.cpp
codeforces_Optimal-Currency-Exchange.cpp		codeforces_Optimal-Currency-Exchange.cpp
codeforces_Party_Easy.cpp		codeforces_Party_Easy.cpp
codeforces_Pashmak_and_flowers.cpp		codeforces_Pashmak_and_flowers.cpp
codeforces_Pashmak_and_garden.cpp		codeforces_Pashmak_and_garden.cpp
codeforces_Pipes.cpp		codeforces_Pipes.cpp
codeforces_Prefixes.cpp		codeforces_Prefixes.cpp
codeforces_Prinzessin_der_Verurteilung.cpp		codeforces_Prinzessin_der_Verurteilung.cpp
codeforces_Puzzles.cpp		codeforces_Puzzles.cpp
codeforces_Queue_at_the_school.cpp		codeforces_Queue_at_the_school.cpp
codeforces_Reading_books.cpp		codeforces_Reading_books.cpp
codeforces_Remove_smallest.cpp		codeforces_Remove_smallest.cpp
codeforces_Required_Remainder.cpp		codeforces_Required_Remainder.cpp
codeforces_Road_construction.cpp		codeforces_Road_construction.cpp
codeforces_Sale.cpp		codeforces_Sale.cpp
codeforces_Same_parity_summands.cpp		codeforces_Same_parity_summands.cpp
codeforces_Sereja_and_Brackets.cpp		codeforces_Sereja_and_Brackets.cpp
codeforces_Sereja_and_bottles.cpp		codeforces_Sereja_and_bottles.cpp
codeforces_Shooting.cpp		codeforces_Shooting.cpp
codeforces_Simple_Molecules.cpp		codeforces_Simple_Molecules.cpp
codeforces_Slightly_decreasing_permutations.cpp		codeforces_Slightly_decreasing_permutations.cpp
codeforces_Social_network.cpp		codeforces_Social_network.cpp

Repository files navigation

#include <bits/stdc++.h>

using namespace std;

int seg[4*100000];
int lazy[4*100000];

void update(int node, int s, int e, int us, int ue, int vs){
    int m=(s+e)/2;
    if(lazy[node]){
        seg[node]=lazy[node];
        if(s!=e){
            lazy[2*node]=seg[node];
            lazy[2*node+1]=seg[node]+m-s+1;
        }
        lazy[node]=0;
    }

    if(s>ue or e<us){
        return;
    }

    if(us<=s and e<=ue){
        seg[node]=s-us+vs;
        if(s!=e){
            lazy[2*node]=seg[node];
            lazy[2*node+1]=seg[node]+m-s+1;
        }
        return;
    }

    seg[node]=0;
    update(2*node,s,m,us,ue,vs);
    update(2*node+1,m+1,e,us,ue,vs);
}


int query( int node, int s, int e, int pos){
    int m=(s+e)/2;
    if(lazy[node]){
        seg[node]=lazy[node];
        if(s!=e){
            lazy[2*node]=seg[node];
            lazy[2*node+1]=seg[node]+m-s+1;
        }
        lazy[node]=0;
    }

    if(s==e){
        return seg[node];
    }

    if(pos<=m){
        return query(2*node,s,m,pos);
    }else{
        return query(2*node+1,m+1,e,pos);
    }
}
int main(){
    long a[100005];
    long b[100005];
    int tam, n, ia, ib, comp, tipo,pos;
    scanf("%d %d",&tam,&n);
    for(int i=1;i<=tam;i++){
        scanf("%ld",&a[i]);
    }
    for(int i=1;i<=tam;i++){
        scanf("%ld",&b[i]);
    }

    while(n--){
        scanf("%d",&tipo);
        if(tipo==1){
            scanf("%d %d %d",&ia,&ib,&comp);
            update(1,1,tam,ib,ib+comp-1,ia);
        }else{
            scanf("%d",&pos);
            int pos_a=query(1,1,tam,pos);
            if(pos_a){
                printf("%ld\n",a[pos_a]);
            }else{
                printf("%ld\n",b[pos]);
            }
        }
    }
    return 0;
}