Submission #60734896

---

Source Code Expand

// #undef LOCAL
#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstring>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <array>
#include <random>
#include <cassert>
#include <chrono>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/priority_queue.hpp>
using namespace std;
#ifdef LOCAL
#include "D:\c++\Algo\Debug.h"
#define print(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(...) (void)0
#define dbg(a, l, r) (void)0
#define print(fmt, ...) (void)0
#endif
bool Mbg;
namespace Anonyme {
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define QwQ01AwA return 0
#define mset(a, x) memset(begin(a), x, sizeof(a))
#define mcpy(a, b) memcpy(begin(a), begin(b), sizeof(a))
#define range(a, l, r) begin(a) + l, begin(a) + r + 1
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ep emplace
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using d32 = double;
using d64 = long double;
using pii = pair<int, int>;
template <class T> using vc = vector<T>;
template <class T> using pq = priority_queue<T>;
template <class T> using rpq = priority_queue<T, vector<T>, greater<T>>;
template <class T, int siz> using ar = array<T, siz>;
template <class T, class U> inline bool ckmax(T &x, U &&y) {return x < y ? (x = y, 1) : 0;}
template <class T, class U> inline bool ckmin(T &x, U &&y) {return x > y ? (x = y, 1) : 0;}
const int inf32 = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3f;

void main01() {
	#ifdef LOCAL
	file("");
	#endif
	cin.tie(nullptr) -> sync_with_stdio(false);
	int n;
	i64 res;
	cin >> n >> res;
	vc<int> a(n);
	for (auto &x : a) cin >> x;
	i64 s = accumulate(all(a), 0ll);
	vc<int> b;
	for (auto x : a) b.eb(x);
	for (auto x : a) b.eb(x);
	a = b;
	map<i64, i64> mp;
	mp[0] = 0;
	i64 pre = 0;
	for (int i = 0; i < 2 * n; i++) {
		pre += a[i];
		i64 it = (pre - res) % s;
		it = (it + s) % s;
		if (mp.find(it) != end(mp) && pre - mp[it] <= res) return cout << "Yes" << '\n', void();
		if (mp.find(pre % s) == end(mp)) mp[pre % s] = pre;
		else ckmin(mp[res % s], res);
	}
	cout << "No" << '\n'; 
}}
bool Med;
signed main() {
	Anonyme::main01();
	#ifdef LOCAL
	cerr << endl;
	cerr << "\033[0m\033[0;32m" "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n" "\033[0m";
	cerr << "\033[0m\033[0;33m" "Memory: " << abs(&Mbg - &Med) / 1048576.0 << "mb\n" "\033[0m";
	#endif
	QwQ01AwA;
}

Submission Info

Judge Result