fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. inline int power(int a, int b) {
  6.     int x = 1;
  7.     while (b) {
  8.         if (b & 1) x *= a;
  9.         a *= a;
  10.         b >>= 1;
  11.     }
  12.     return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. void consistency(int n) {
  27.  
  28. 	int s = 0, e = n-1;
  29. 	int curr = s;
  30. 	int p1 = 0, p2 = 0;
  31. 	int toggle = 1;
  32.  
  33. 	while(s<=e){
  34. 		if(toggle){
  35. 			p1 += a[curr];
  36. 		}	
  37. 		else{
  38. 			p2 += a[curr];
  39. 		}
  40. 		bool isEven = (a[curr] & 1) ? false : true;
  41. 		if(curr == s){
  42. 			s++;
  43. 			curr = s;
  44. 		}
  45. 		else{
  46. 			e--;
  47. 			curr = e;
  48. 		}
  49. 		if(isEven){
  50. 			if(curr == s) curr = e;
  51. 			else curr = s;
  52. 		}
  53. 		toggle ^= 1;
  54. 	}
  55.  
  56. 	cout << p1-p2 << endl;
  57.  
  58. }
  59.  
  60. void solve() {
  61.  
  62.     int n;
  63.     cin >> n;
  64.     a.resize(n);
  65.  
  66.     for(int i=0; i<n; i++) cin >> a[i];
  67.  
  68.     consistency(n) ;
  69.  
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76. int32_t main() {
  77.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  78.  
  79.     int t = 1;
  80.     while (t--) {
  81.         solve();
  82.     }
  83.  
  84.     return 0;
  85. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
2
2 2
stdout
copy 
0
https://ideone.com/vKs6te
language:
C++14 (gcc 8.3)
created:
4 days 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!