結果

問題 No.2860 Heal Slimes
ユーザー 👑 binapbinap
提出日時 2024-08-25 16:21:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,020 bytes
コンパイル時間 4,603 ms
コンパイル使用メモリ 263,752 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-08-25 16:21:30
合計ジャッジ時間 12,446 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 124 ms
6,944 KB
testcase_11 AC 98 ms
6,944 KB
testcase_12 AC 97 ms
6,944 KB
testcase_13 AC 97 ms
6,944 KB
testcase_14 AC 98 ms
6,944 KB
testcase_15 AC 86 ms
6,944 KB
testcase_16 AC 86 ms
6,944 KB
testcase_17 AC 85 ms
6,940 KB
testcase_18 AC 86 ms
6,940 KB
testcase_19 AC 85 ms
6,940 KB
testcase_20 AC 64 ms
6,944 KB
testcase_21 AC 66 ms
6,940 KB
testcase_22 AC 45 ms
6,940 KB
testcase_23 AC 84 ms
6,944 KB
testcase_24 AC 77 ms
6,944 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 85 ms
6,940 KB
testcase_41 AC 86 ms
6,944 KB
testcase_42 AC 83 ms
6,940 KB
testcase_43 AC 88 ms
6,944 KB
testcase_44 AC 84 ms
6,940 KB
testcase_45 AC 84 ms
6,944 KB
testcase_46 AC 84 ms
6,944 KB
testcase_47 AC 84 ms
6,940 KB
testcase_48 AC 84 ms
6,944 KB
testcase_49 AC 84 ms
6,940 KB
testcase_50 AC 86 ms
6,940 KB
testcase_51 AC 84 ms
6,940 KB
testcase_52 AC 85 ms
6,940 KB
testcase_53 AC 84 ms
6,944 KB
testcase_54 AC 87 ms
6,940 KB
testcase_55 AC 84 ms
6,940 KB
testcase_56 AC 88 ms
6,940 KB
testcase_57 AC 86 ms
6,944 KB
testcase_58 AC 84 ms
6,940 KB
testcase_59 AC 84 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

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]);
		}
//		cout << vec;
		long long sum = 0;
		for(long long val : vec) sum += val;
		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) if(sum != 0) ans = "No\n";
		long long first = d[i];
		long long last = d[n / k * k + n % k];
		if(!front and first > 0) ans = "No\n";
		if(!back and last < 0) ans = "No\n";
//		cout << i << ' ' << ans;
	}
	cout << ans;
	return 0;
}

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