Posts

Atcoder Educational Dp contest :: C vacation

-
  #include <bits/stdc++.h> using namespace std ; #define ll long long int const inf = 1e9 + 5 ; int const mod = 1e9 + 7 ; int main (){ ll n ; cin >> n ; ll a[n] , b[n] , c[n] ; for ( ll i= 0 ; i<n ; i++)cin >> a[i] >> b[i] >> c[i] ; ll dp[n][ 3 ] ; //base case dp[ 0 ][ 0 ] = a[ 0 ] ; dp[ 0 ][ 1 ] = b[ 0 ] ; dp[ 0 ][ 2 ] = c[ 0 ] ; //recursive case for ( ll i= 1 ; i<n ; i++){ dp[i][ 0 ] = a[i] + max(dp[i- 1 ][ 1 ] , dp[i- 1 ][ 2 ]) ; dp[i][ 1 ] = b[i] + max(dp[i- 1 ][ 0 ] , dp[i- 1 ][ 2 ]) ; dp[i][ 2 ] = c[i] + max(dp[i- 1 ][ 0 ] , dp[i- 1 ][ 1 ]) ; } cout << max({dp[n- 1 ][ 0 ] , dp[n- 1 ][ 1 ] , dp[n- 1 ][ 2 ]}) ; return 0 ; }
Post a Comment
Read more

Atcoder Educational Dp contest :: B frog 2

-
  #include <bits/stdc++.h> using namespace std ; #define ll long long const int inf = 1e9 + 5 ; const int mod = 1e9 + 7 ; int main (){ ll n , k ; cin >> n >> k ; vector < ll > a(n) ; for ( ll i= 0 ; i<n ; i++)cin >> a [ i ] ; vector < ll > dp(n , inf) ; dp [ 0 ] = 0 ; for ( ll i= 0 ; i<n ; i++){ for ( ll j=i+ 1 ; j<=i+k ; j++){ if (j<n){ dp [ j ] = min(dp [ j ] , dp [ i ] +abs(a [ i ] - a [ j ] )) ; } } //cout<<dp[i]<<" "; } cout << dp [ n- 1 ] ; }
Post a Comment
Read more

Atcoder Educational Dp contest :: A frog 1

-
  #include <bits/stdc++.h> using namespace std ; #define ll long long const int inf = 1e9 + 5 ; const int mod = 1e9 + 7 ; int main (){ ll n ; cin >> n ; vector < ll > a(n) ; for ( ll i= 0 ; i<n ; i++)cin >> a [ i ] ; vector < ll > dp(n , inf) ; dp [ 0 ] = 0 ; for ( ll i= 0 ; i<n ; i++){ for ( ll j=i+ 1 ; j<=i+ 2 ; j++){ if (j<n){ dp [ j ] = min(dp [ j ] , dp [ i ] +abs(a [ i ] - a [ j ] )) ; } } //cout<<dp[i]<<" "; } cout << dp [ n- 1 ] ; }
Post a Comment
Read more

CodeChef::VOTERS

-
 #include <bits/stdc++.h> using namespace std ; #define boost ios::sync_with_stdio(0);cin.tie(0) #define ll long long int main(){ boost ; ll n1,n2,n3,n ; cin >> n1 >> n2 >> n3 ; n = n1+n2+n3 ; ll arr[n]; for(ll i = 0; i < n ; i++){     cin >> arr[i] ; } vector <ll> v ; ll count{1},first_elmt; sort(arr,arr+n); first_elmt = arr[0]; for(ll i =1;i<n;i++){     if(first_elmt == arr[i]){         count ++ ;     }     else{         if(count >= 2)         {             v.push_back(first_elmt);         }         first_elmt = arr[i];         count = 1;     } } cout << v.size() << '\n' ; for(ll i = 0;i...
Post a Comment
Read more

CodeChef::CSUB

-
  #include   <bits/stdc++.h> using  namespace   std  ; #define   boost   ios :: sync_with_stdio ( 0 ); cin . tie ( 0 ) #define   ll  long long  int   main  (){      boost  ;      ll   t  ;      cin   >>   t  ;      while  ( t --)     {        ll   n  ;        cin   >>   n  ;        string   seq  ;        cin   >>   seq  ;        ll   count { 0 };        for  ( int   i  =  0 ;  i  <  seq . size ();  i ++){            if  ( seq [ i ]  ==...
Post a Comment
Read more

CodeChef::Bowlers(Incorrect)

-
  #include   <bits/stdc++.h> #define   boost   ios :: sync_with_stdio ( 0 ); cin . tie ( 0 ) using  namespace   std  ; int   main  (){      boost  ;      long   long   int   t  ;      cin   >>   t  ;      while  ( t --)     {          long   long   int   n , k , l  ;          cin   >>   n   >>   k   >>   l  ;          long   long   int   temp  =  k  ;          if ( k  *  l  <  n )  cout   <<  - 1   <<   ' \n ' ;          else  ...
Post a Comment
Read more

Check if Array is Sorted?

-
  #include   <bits/stdc++.h> using  namespace   std  ; bool   sorted ( int   arr [], int   n ){     //Base case      if ( n == 0  ||  n == 1 )  return   true  ;      if ( arr [ 0 ] >  arr [ 1 ])  return   false  ;          //Recursive case      bool   smallarraysorted  =  sorted ( arr + 1  ,  n - 1 );     // Calculation      if ( smallarraysorted )  return   true  ;      else   return   false  ; } int   main (){      int   arr [] = { 1 , 2 , 3 , 5 , 4 } ;      int   n  =  5  ;      cout   <<   sorted ( arr , n ) ;  ...
Post a Comment
Read more