fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<vector<int>> a;
  31.  
  32. int consistency(int n){
  33.  
  34.     vector<vector<vector<int>>> dp(n/2, vector<vector<int>>(3, vector<int>(3, INF))); 
  35.  
  36.     for(int i=0; i<=n/2-1; i++){    
  37.  
  38.         for(int j=0; j<3; j++){
  39.             for(int k=0; k<3; k++){
  40.                 if(j==k) continue;  
  41.  
  42.                 dp[i][j][k] = a[i][j] + a[n-i-1][k];    
  43.                 if(i==0) continue;
  44.  
  45.                 int mini = INF;
  46.                 for(int p=0; p<3; p++){
  47.                     for(int q=0; q<3; q++){
  48.                         if(p==q || p==j || q==k) continue;
  49.                         mini = min(mini,  dp[i-1][p][q]);
  50.                     }
  51.                 }
  52.                 dp[i][j][k] += mini;
  53.             }
  54.         }
  55.     }  
  56.  
  57.     int mini = INF;
  58.     for(int i=0; i<3; i++){
  59.         for(int j=0; j<3; j++){
  60.             mini = min(mini, dp[n/2-1][i][j]);
  61.         }
  62.     }
  63.  
  64.     return mini;
  65.  
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82. int practice(int n){
  83.  
  84.  
  85.     return 0;
  86. }
  87.  
  88.  
  89.  
  90.  
  91.  
  92. void solve() {
  93.  
  94.     int n;
  95.     cin>> n;
  96.  
  97.     a.resize(n);
  98.     for(int i=0; i<n; i++){
  99.     	int x, y, z;
  100.     	cin >> x >> y >> z;
  101.     	a[i] = {x, y, z};
  102.     }
  103.  
  104.     cout << consistency(n) << endl;
  105.  
  106.  
  107. }
  108.  
  109.  
  110.  
  111.  
  112.  
  113. int32_t main() {
  114.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  115.  
  116.     int t = 1;
  117.     // cin >> t;
  118.     while (t--) {
  119.         solve();
  120.     }
  121.  
  122.     return 0;
  123. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
6
5 3 1
1 3 5
1 2 1
2 1 1
1 4 2
1 1 2
stdout
copy 
7
https://ideone.com/AbL9P3
language:
C++14 (gcc 8.3)
created:
23 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!