結果
問題 | No.2684 折々の色 |
ユーザー | akiaa11 |
提出日時 | 2024-03-21 19:00:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,782 bytes |
コンパイル時間 | 4,199 ms |
コンパイル使用メモリ | 271,600 KB |
実行使用メモリ | 83,032 KB |
最終ジャッジ日時 | 2024-09-30 10:14:27 |
合計ジャッジ時間 | 23,303 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 3 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 3 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 314 ms
39,680 KB |
testcase_12 | AC | 177 ms
28,160 KB |
testcase_13 | AC | 266 ms
45,568 KB |
testcase_14 | AC | 115 ms
24,832 KB |
testcase_15 | AC | 226 ms
32,724 KB |
testcase_16 | AC | 40 ms
10,368 KB |
testcase_17 | AC | 143 ms
25,344 KB |
testcase_18 | AC | 307 ms
42,496 KB |
testcase_19 | AC | 357 ms
47,616 KB |
testcase_20 | AC | 169 ms
35,456 KB |
testcase_21 | AC | 76 ms
13,952 KB |
testcase_22 | AC | 444 ms
43,520 KB |
testcase_23 | AC | 239 ms
35,968 KB |
testcase_24 | AC | 109 ms
17,536 KB |
testcase_25 | AC | 159 ms
24,704 KB |
testcase_26 | AC | 358 ms
46,592 KB |
testcase_27 | AC | 210 ms
30,592 KB |
testcase_28 | AC | 237 ms
35,584 KB |
testcase_29 | AC | 569 ms
81,164 KB |
testcase_30 | AC | 531 ms
72,704 KB |
testcase_31 | AC | 444 ms
73,344 KB |
testcase_32 | AC | 666 ms
81,556 KB |
testcase_33 | AC | 524 ms
82,388 KB |
testcase_34 | AC | 572 ms
72,484 KB |
testcase_35 | AC | 569 ms
73,080 KB |
testcase_36 | AC | 440 ms
72,656 KB |
testcase_37 | AC | 480 ms
73,324 KB |
testcase_38 | AC | 721 ms
82,872 KB |
testcase_39 | AC | 731 ms
82,944 KB |
testcase_40 | AC | 727 ms
82,944 KB |
testcase_41 | AC | 707 ms
82,936 KB |
testcase_42 | AC | 739 ms
82,944 KB |
testcase_43 | AC | 716 ms
82,928 KB |
testcase_44 | AC | 724 ms
82,944 KB |
testcase_45 | AC | 709 ms
82,916 KB |
testcase_46 | AC | 724 ms
83,032 KB |
testcase_47 | AC | 2 ms
5,248 KB |
testcase_48 | AC | 1 ms
5,248 KB |
testcase_49 | AC | 2 ms
5,248 KB |
testcase_50 | AC | 1 ms
5,248 KB |
testcase_51 | AC | 2 ms
5,248 KB |
testcase_52 | AC | 2 ms
5,248 KB |
testcase_53 | AC | 1 ms
5,248 KB |
testcase_54 | AC | 1 ms
5,248 KB |
testcase_55 | AC | 2 ms
5,248 KB |
testcase_56 | AC | 2 ms
5,248 KB |
testcase_57 | WA | - |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, m;cin>>n>>m; vecll a(m); rep(i, m) cin>>a[i]; rep(i, m) a[i] *= 10000; vector b(n, vecll(m)); vector r(n, vecll(m)); vecll t(n); multiset<vecll> st; rep(i, n){ rep(j, m) cin>>b[i][j]; cin>>t[i]; r[i] = b[i]; rep(j, m) r[i][j] *= t[i]; st.insert(r[i]); } int u = 0; rep(i, n){ st.erase(r[i]); int u2 = 1; vecll c(m); rep(j, m){ ll d = a[j] - 100 * t[i] * b[i][j]; if(t[i] == 100){ if(d == 0) continue; u2 = 0; break; } if(d % (100 - t[i])){ u2 = 0; break; } d /= 100 - t[i]; c[j] = d; } if(u2 && st.find(c) != st.end()){ u = 1; break; } st.insert(r[i]); } cout<<(u ? "Yes" : "No")<<endl; }