#1004594 (C++23) No.2860 Heal Slimes

提出ソース

結果

問題	No.2860 Heal Slimes
ユーザー	noya2
提出日時	2024-08-25 14:41:29
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	47 ms / 2,000 ms
コード長	5,778 bytes
コンパイル時間	3,470 ms
コンパイル使用メモリ	254,416 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-08-25 14:41:37
合計ジャッジ時間	7,433 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	23 ms 6,816 KB
testcase_01	AC	23 ms 6,944 KB
testcase_02	AC	23 ms 6,944 KB
testcase_03	AC	23 ms 6,944 KB
testcase_04	AC	23 ms 6,940 KB
testcase_05	AC	47 ms 6,944 KB
testcase_06	AC	34 ms 6,940 KB
testcase_07	AC	35 ms 6,940 KB
testcase_08	AC	34 ms 6,944 KB
testcase_09	AC	35 ms 6,944 KB
testcase_10	AC	23 ms 6,940 KB
testcase_11	AC	23 ms 6,944 KB
testcase_12	AC	24 ms 6,940 KB
testcase_13	AC	24 ms 6,944 KB
testcase_14	AC	23 ms 6,940 KB
testcase_15	AC	31 ms 6,940 KB
testcase_16	AC	31 ms 6,940 KB
testcase_17	AC	30 ms 6,940 KB
testcase_18	AC	30 ms 6,944 KB
testcase_19	AC	30 ms 6,940 KB
testcase_20	AC	24 ms 6,940 KB
testcase_21	AC	26 ms 6,944 KB
testcase_22	AC	18 ms 6,940 KB
testcase_23	AC	30 ms 6,944 KB
testcase_24	AC	28 ms 6,940 KB
testcase_25	AC	19 ms 6,944 KB
testcase_26	AC	15 ms 6,940 KB
testcase_27	AC	26 ms 6,944 KB
testcase_28	AC	28 ms 6,940 KB
testcase_29	AC	21 ms 6,940 KB
testcase_30	AC	25 ms 6,940 KB
testcase_31	AC	29 ms 6,944 KB
testcase_32	AC	28 ms 6,944 KB
testcase_33	AC	26 ms 6,940 KB
testcase_34	AC	30 ms 6,944 KB
testcase_35	AC	27 ms 6,940 KB
testcase_36	AC	25 ms 6,940 KB
testcase_37	AC	27 ms 6,944 KB
testcase_38	AC	26 ms 6,944 KB
testcase_39	AC	27 ms 6,940 KB
testcase_40	AC	32 ms 6,940 KB
testcase_41	AC	31 ms 6,940 KB
testcase_42	AC	31 ms 6,940 KB
testcase_43	AC	33 ms 6,940 KB
testcase_44	AC	31 ms 6,944 KB
testcase_45	AC	31 ms 6,940 KB
testcase_46	AC	31 ms 6,944 KB
testcase_47	AC	31 ms 6,940 KB
testcase_48	AC	31 ms 6,944 KB
testcase_49	AC	30 ms 6,944 KB
testcase_50	AC	33 ms 6,944 KB
testcase_51	AC	32 ms 6,944 KB
testcase_52	AC	31 ms 6,944 KB
testcase_53	AC	30 ms 6,944 KB
testcase_54	AC	33 ms 6,944 KB
testcase_55	AC	31 ms 6,940 KB
testcase_56	AC	34 ms 6,944 KB
testcase_57	AC	32 ms 6,944 KB
testcase_58	AC	31 ms 6,944 KB
testcase_59	AC	31 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n, k; in(n,k);
    ll x; in(x);
    vector<ll> a(n); in(a);
    rep(i,n){
        if (a[i] % x != a[0] % x){
            no();
            return ;
        }
    }
    rep(i,n){
        a[i] /= x;
    }
    vector<ll> ds(n+1);
    ds[0] = a[0];
    rep(i,n-1){
        ds[i+1] = a[i+1] - a[i];
    }
    ds[n] = -a[n-1];
    rep(m,k){
        vector<ll> b;
        for (int i = m; i <= n; i += k){
            b.emplace_back(ds[i]);
        }
        if (m % k != 0){
            int sz = b.size();
            rep(i,sz-1){
                if (b[i] > 0){
                    no();
                    return ;
                }
                ll add = -b[i];
                b[i] += add;
                b[i+1] -= add;
            }
        }
        else if (m % k != n % k){
            int sz = b.size();
            reb(i,sz-1){
                if (b[i+1] < 0){
                    no();
                    return ;
                }
                ll add = b[i+1];
                b[i+1] -= add;
                b[i] += add;
            }
        }
        else {
            int sz = b.size();
            rep(i,sz) b[i] = 0;
        }
        if (m % k == 0){
            b.front() = 0;
        }
        if (m % k == n % k){
            b.back() = 0;
        }
        if (b.front() == 0 && b.back() == 0) continue;
        no();
        return ;
    }
    yes();
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード