Submission #3788565


Source Code Expand

//#include <bits/stdc++.h>
//using namespace std;
//
//using VS = vector<string>;    using LL = long long;
//using VI = vector<int>;       using VVI = vector<VI>;
//using PII = pair<int, int>;   using PLL = pair<LL, LL>;
//using VL = vector<LL>;        using VVL = vector<VL>;
//
//#define ALL(a)  begin((a)),end((a))
//#define RALL(a) (a).rbegin(), (a).rend()
//#define SZ(a) int((a).size())
//#define SORT(c) sort(ALL((c)))
//#define RSORT(c) sort(RALL((c)))
//#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
//#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
//#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
////#pragma GCC optimize ("-O3") 
//#ifdef YANG33
//#include "mydebug.hpp"
//#else
//#define DD(x) 
//#endif
//const int INF = 1e9;                          const LL LINF = 1e16;
//const LL MOD = 1000000007;                    const double PI = acos(-1.0);
//int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
//
///* -----  2018/12/13  Problem: ARC 004 B / Link: http://arc004.contest.atcoder.jp/tasks/arc004_b  ----- */
///* ------問題------
//
//
//
//-----問題ここまで----- */
///* -----解説等-----
//
//
//
//----解説ここまで---- */
//
//
//int main() {
//	cin.tie(0);
//	ios_base::sync_with_stdio(false);
//
//	LL N; cin >> N;
//	VL a(N);
//	FOR(i, 0, N) {
//		cin >> a[i];
//	}
//	LL sum = accumulate(ALL(a), 0LL);
//	cout << sum << endl;
//
//	LL ans = LINF;
//	LL mx = *max_element(ALL(a));
//	if (sum - mx < mx) {
//		ans = mx - (sum - mx);
//	}
//	else {
//		ans = 0;
//	}
//	cout << ans << "\n";
//
//	return 0;
//}

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/12/13  Problem: ARC 004 B / Link: http://arc004.contest.atcoder.jp/tasks/arc004_b  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */


int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	LL N; cin >> N;
	VL a(N);
	FOR(i, 0, N) {
		cin >> a[i];
	}
	cout << accumulate(ALL(a), 0LL) << endl;

	// min:頂点と辺をみればよい?
	VL csum(N + 1, 0);
	FOR(i, 0, N) {
		csum[i + 1] = csum[i] + a[i];
	}
	auto query = [&csum](int l, int r) {
		return csum[r] - csum[l];
	};


	// vertex
	LL ans = LINF;
	FOR(i, 0, N) {
		ans = min(ans, abs(query(0, i) - query(i, N)));
	}
	DD(de(ans));
	// edge
	FOR(i, 1, N - 1) {
		LL b = query(0, i);
		LL c = a[i];
		LL d = query(i + 1, N);
		LL ret = max(0LL, c - (b + d));
		ans = min(ans, ret);
	}
	assert(ans != LINF);
	cout << ans << "\n";

	return 0;
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User Yang33
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3593 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 54
WA × 9
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt WA 1 ms 256 KB
01_rnd_02.txt WA 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt WA 1 ms 256 KB
01_rnd_09.txt WA 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt AC 1 ms 256 KB
01_rnd_13.txt AC 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt WA 1 ms 256 KB
02_rnd2_00.txt AC 1 ms 256 KB
02_rnd2_01.txt AC 1 ms 256 KB
02_rnd2_02.txt AC 1 ms 256 KB
02_rnd2_03.txt AC 1 ms 256 KB
02_rnd2_04.txt AC 1 ms 256 KB
02_rnd2_05.txt AC 1 ms 256 KB
02_rnd2_06.txt AC 1 ms 256 KB
02_rnd2_07.txt AC 1 ms 256 KB
02_rnd2_08.txt AC 1 ms 256 KB
02_rnd2_09.txt AC 1 ms 256 KB
02_rnd2_10.txt AC 1 ms 256 KB
02_rnd2_11.txt AC 1 ms 256 KB
02_rnd2_12.txt AC 1 ms 256 KB
02_rnd2_13.txt AC 1 ms 256 KB
02_rnd2_14.txt AC 1 ms 256 KB
02_rnd2_15.txt AC 1 ms 256 KB
02_rnd2_16.txt AC 1 ms 256 KB
02_rnd2_17.txt AC 1 ms 256 KB
02_rnd2_18.txt AC 1 ms 256 KB
02_rnd2_19.txt AC 1 ms 256 KB
02_rnd2_20.txt AC 1 ms 256 KB
02_rnd2_21.txt AC 1 ms 256 KB
02_rnd2_22.txt AC 1 ms 256 KB
02_rnd2_23.txt AC 1 ms 256 KB
02_rnd2_24.txt AC 1 ms 256 KB
02_rnd2_25.txt AC 1 ms 256 KB
02_rnd2_26.txt AC 1 ms 256 KB
02_rnd2_27.txt AC 1 ms 256 KB
02_rnd2_28.txt AC 1 ms 256 KB
02_rnd2_29.txt AC 1 ms 256 KB
03_max_00.txt AC 1 ms 256 KB
03_max_01.txt WA 1 ms 256 KB
03_max_02.txt AC 1 ms 256 KB
03_max_03.txt AC 1 ms 256 KB
03_max_04.txt AC 1 ms 256 KB
03_max_05.txt AC 1 ms 256 KB
03_max_06.txt AC 1 ms 256 KB
03_max_07.txt WA 1 ms 256 KB
03_max_08.txt WA 1 ms 256 KB
03_max_09.txt WA 1 ms 256 KB
04_maxret_01.txt AC 1 ms 256 KB
04_maxret_02.txt AC 1 ms 256 KB