提出 #34219283

---

ソースコード 拡げる

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n;
long long a, b, c;
int arr[200010];
long long prefix[200010];

bool check(int l, int r)
{
	int s, e;
	int mid;
	bool flag;

	s = l;
	e = r;
	flag = false;
	while (s <= e)
	{
		mid = (s + e) / 2;

		if (prefix[mid] - prefix[l - 1] == a)
		{
			flag = true;
			break;
		}
		else if (prefix[mid] - prefix[l - 1] < a) s = mid + 1;
		else e = mid - 1;
	}

	if (!flag) return false;

	l = mid + 1;
	s = l;
	e = r;
	flag = false;
	while (s <= e)
	{
		mid = (s + e) / 2;

		if (prefix[mid] - prefix[l - 1] == b)
		{
			flag = true;
			break;
		}
		else if (prefix[mid] - prefix[l - 1] < b) s = mid + 1;
		else e = mid - 1;
	}

	return flag;
}

int main()
{
	int i;
	int s, e;
	long long sum;

	cin >> n >> a >> b >> c;
	for (i = 1; i <= n; i++)
	{
		cin >> arr[i];
	}

	for (i = 1; i <= n; i++)
	{
		prefix[i] = prefix[i - 1] + arr[i];
	}

	s = 1;
	e = 0;
	sum = 0;
	while (e <= n)
	{
		if (sum == a + b + c)
		{
			if (check(s, e))
			{
				cout << "Yes";
				return 0;
			}

			e++;
			sum += arr[e];
		}
		else if (sum < a + b + c)
		{
			e++;
			sum += arr[e];
		}
		else
		{
			sum -= arr[s];
			s++;
		}
	}

	cout << "No";
}

提出情報

ジャッジ結果