結果

問題 No.2684 折々の色
コンテスト
ユーザー shinchan
提出日時 2024-03-20 22:33:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 892 ms / 2,000 ms
コード長 4,732 bytes
コンパイル時間 2,338 ms
コンパイル使用メモリ 206,128 KB
最終ジャッジ日時 2025-02-20 09:35:47
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 56
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto&& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

template<int MOD> struct Modint {
    long long val;
    constexpr Modint(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; }
    constexpr int mod() const { return MOD; }
    constexpr long long value() const { return val; }
    constexpr Modint operator - () const noexcept { return val ? MOD - val : 0; }
    constexpr Modint operator + (const Modint& r) const noexcept { return Modint(*this) += r; }
    constexpr Modint operator - (const Modint& r) const noexcept { return Modint(*this) -= r; }
    constexpr Modint operator * (const Modint& r) const noexcept { return Modint(*this) *= r; }
    constexpr Modint operator / (const Modint& r) const noexcept { return Modint(*this) /= r; }
    constexpr Modint& operator += (const Modint& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Modint& operator -= (const Modint& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Modint& operator *= (const Modint& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Modint& operator /= (const Modint& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Modint& r) const noexcept { return this->val == r.val; }
    constexpr bool operator != (const Modint& r) const noexcept { return this->val != r.val; }
    friend constexpr istream& operator >> (istream& is, Modint<MOD>& x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream& operator << (ostream& os, const Modint<MOD>& x) noexcept {
        return os << x.val;
    }
    constexpr Modint<MOD> pow(long long n) noexcept {
        if (n == 0) return 1;
        if (n < 0) return this->pow(-n).inv();
        Modint<MOD> ret = pow(n >> 1);
        ret *= ret;
        if (n & 1) ret *= *this;
        return ret;
    }
    constexpr Modint<MOD> inv() noexcept {
        long long a = this->val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Modint<MOD>(u);
    }
};

// const int MOD1 = MOD7, MOD2 = MOD998, MOD3 = 1000000007;
// using mint1 = Modint<MOD1>, mint2 = Modint<MOD2>, mint = Modint<MOD3>;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, m;
    cin >> n >> m;
    vector<ll> x(m);
    rep(i, m) {
        cin >> x[i];
        x[i] *= 10000;
    }
    vector c(n, vector<ll> (m, 0LL));
    vector t(n, 0LL);
    rep(i, n) {
        rep(j, m) cin >> c[i][j];
        cin >> t[i];
    }

    auto solve = [&](bool flag = 0) -> void {
        set<vector<ll>> st;
        rep(i, n) {
            if(t[i] == 100) {
                vector<ll> v(m);
                rep(j, m) {
                    v[j] = c[i][j] * 100 * t[i];
                }
                if(v == x) {
                    cout << "Yes" << endl;
                    exit(0);
                }
            } else {
                bool ng = false;
                vector<ll> v(m);
                rep(j, m) {
                    ll num = x[j] - c[i][j] * 100 * t[i];
                    // if(flag and i == n - 1) cout << num << " " << (ll(100) - t[i]) << endl;
                    if(num % (ll(100) - t[i])) {
                        ng = true;
                        break;
                    }
                    num /= (ll(100) - t[i]);
                    v[j] = num;
                    // if(flag and i == n - 1) cout << v[j] << " ";
                }
                // if(flag and i == n - 1) cout <<endl;
                if(!ng) {
                    if(st.count(v)) {
                        cout << "Yes" << endl;
                        exit(0);
                    }
                }
            }

            vector<ll> v(m);
            rep(j, m) {
                v[j] = t[i] * c[i][j];
            }
            st.insert(v);
        }
    };
    solve();
    reverse(all(c));
    reverse(all(t));
    solve(1);
    cout << "No" << endl;
    return 0;
}
0