Submission #6312080


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
bool isSquare(ll n) {
	ll d = (ll)sqrt(n) - 1;
	while (d * d < n) ++d;
	return d * d == n;
}

/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/














int N; ll A[101010];
ll X[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N;
	rep(i, 0, N) cin >> A[i];

	X[0] = 0;
	rep(i, 0, N) {
		if (i % 2 == 0) X[0] += A[i];
		else X[0] -= A[i];
	}

	rep(i, 1, N) X[i] = 2 * A[i - 1] - X[i - 1];

	rep(i, 0, N) {
		if (i) printf(" ");
		printf("%lld", X[i]);
	}
	printf("\n");
}





Submission Info

Submission Time
Task D - Rain Flows into Dams
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1820 Byte
Status AC
Exec Time 22 ms
Memory 2944 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 18
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 13 ms 1792 KB
testcase_02 AC 16 ms 2048 KB
testcase_03 AC 22 ms 2816 KB
testcase_04 AC 2 ms 384 KB
testcase_05 AC 19 ms 2304 KB
testcase_06 AC 19 ms 2304 KB
testcase_07 AC 8 ms 1152 KB
testcase_08 AC 19 ms 2304 KB
testcase_09 AC 11 ms 1280 KB
testcase_10 AC 1 ms 256 KB
testcase_11 AC 21 ms 2432 KB
testcase_12 AC 21 ms 2432 KB
testcase_13 AC 22 ms 2944 KB
testcase_14 AC 1 ms 256 KB
testcase_15 AC 16 ms 2048 KB