結果

問題 No.2684 折々の色
ユーザー dyktr_06dyktr_06
提出日時 2024-03-20 22:26:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,616 bytes
コンパイル時間 2,740 ms
コンパイル使用メモリ 217,412 KB
実行使用メモリ 36,532 KB
最終ジャッジ日時 2024-09-30 08:24:41
合計ジャッジ時間 11,621 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 WA -
testcase_08 AC 2 ms
5,248 KB
testcase_09 WA -
testcase_10 AC 2 ms
5,248 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 16 ms
6,528 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 25 ms
7,936 KB
testcase_22 AC 111 ms
20,352 KB
testcase_23 AC 93 ms
16,896 KB
testcase_24 AC 39 ms
9,216 KB
testcase_25 AC 60 ms
12,160 KB
testcase_26 AC 120 ms
21,248 KB
testcase_27 AC 74 ms
14,720 KB
testcase_28 AC 91 ms
16,640 KB
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 AC 236 ms
36,352 KB
testcase_39 AC 243 ms
36,480 KB
testcase_40 AC 251 ms
36,372 KB
testcase_41 AC 248 ms
36,384 KB
testcase_42 AC 234 ms
36,396 KB
testcase_43 AC 238 ms
36,468 KB
testcase_44 AC 235 ms
36,532 KB
testcase_45 AC 246 ms
36,464 KB
testcase_46 AC 242 ms
36,532 KB
testcase_47 AC 2 ms
5,248 KB
testcase_48 WA -
testcase_49 AC 2 ms
5,248 KB
testcase_50 AC 2 ms
5,248 KB
testcase_51 WA -
testcase_52 AC 1 ms
5,248 KB
testcase_53 WA -
testcase_54 AC 2 ms
5,248 KB
testcase_55 AC 1 ms
5,248 KB
testcase_56 AC 1 ms
5,248 KB
testcase_57 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n, m;
vll x;
vector<vll> c;
vll t;

void input(){
    in(n, m);
    vin(x, m);
    c = vector<vll>(n, vll(m));
    t.resize(n);
    rep(i, n){
        rep(j, m){
            in(c[i][j]);
        }
        in(t[i]);
    }
}

void solve(){
    rep(i, n){
        if(t[i] != 100) continue;
        ll check = 1;
        rep(j, m){
            if(c[i][j] != x[j]) check = 0;
        }
        if(check){
            out("Yes");
            return;
        }
    }

    rep(i, n) rep(j, m){
        c[i][j] *= t[i];
    }
    // rep(i, n) out(c[i]);
    rep(i, m) x[i] *= 10000;
    map<vll, ll> mp, mp2;
    string ans = "No";
    rep(i, n){
        if(t[i] == 100) continue;

        vll y = x;
        ll check = 0;
        rep(j, m){
            y[j] -= c[i][j] * 100;
            if(y[j] % (100 - t[i])){
                check = 1;
                break;
            }
            y[j] /= (100 - t[i]);
        }
        if(check) continue;
        if(mp.count(y)){
            ans = "Yes";
        }
        mp[c[i]] = 1;
    }

    rrep(i, n){
        if(t[i] == 100) continue;

        vll y = x;
        ll check = 0;
        rep(j, m){
            y[j] -= c[i][j] * 100;
            if(y[j] % (100 - t[i])){
                check = 1;
                break;
            }
            y[j] /= (100 - t[i]);
        }
        if(check) continue;
        if(mp2.count(y)){
            ans = "Yes";
        }
        mp2[c[i]] = 1;
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0