結果

問題 No.2860 Heal Slimes
ユーザー 👑 binapbinap
提出日時 2024-08-25 16:29:04
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,260 bytes
コンパイル時間 4,382 ms
コンパイル使用メモリ 264,020 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-08-25 16:29:16
合計ジャッジ時間 11,359 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 35 WA * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int solve(){
	int n, k, x;
	cin >> n >> k >> x;
	vector<long long> a(n);
	cin >> a;
	vector<long long> d(n + 1);
	for(int i = 1; i < n; i++) d[i] = a[i] - a[i - 1];
	string ans = "Yes\n";
	rep(i, k){
		bool front;
		bool back;
		if(i == 0) front = true;
		if(n % k == i) back = true;
		vector<long long> vec;
		for(int j = i; j <= n; j+= k){
			if(j != 0 and j != n) vec.push_back(d[j]);
		}
		if(vec.size() == 0) continue;
		long long g = abs(d[i]);
		for(long long val : vec) g = gcd(g, abs(val));
		if(g % x != 0) ans = "No\n";
		if(!front and !back){
			int m = vec.size();
			long long sum = 0;
			if(sum != 0) ans = "No\n";
			vector<long long> pre(m);
			vector<long long> suf(m);
			rep(j, m) pre[j] += vec[j];
			rep(j, m) suf[j] += vec[j];
			rep(j, m - 1) pre[j + 1] += pre[j];
			for(int j = m - 2; j >= 0; j--) suf[j] += suf[j + 1];
			rep(j, m - 1) if(!(pre[j] <= 0 and suf[j + 1] >=  0)) ans = "No\n";
		}
		if(!front and vec.front() > 0) ans = "No\n";
		if(!back and vec.back() < 0) ans = "No\n";
//		cout << i << ' ' << ans;
	}
	cout << ans;
	return 0;
}

int main(){
	int t;
	cin >> t;
	rep(_, t) solve();
	return 0;
}
0