結果
問題 | No.2684 折々の色 |
ユーザー | sgfc |
提出日時 | 2024-03-20 22:18:45 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,063 bytes |
コンパイル時間 | 8,653 ms |
コンパイル使用メモリ | 457,152 KB |
実行使用メモリ | 53,376 KB |
最終ジャッジ日時 | 2024-09-30 08:16:11 |
合計ジャッジ時間 | 43,399 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | RE | - |
testcase_05 | AC | 3 ms
5,248 KB |
testcase_06 | RE | - |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | RE | - |
testcase_09 | AC | 3 ms
5,248 KB |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | AC | 2 ms
5,248 KB |
testcase_51 | AC | 2 ms
5,248 KB |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | AC | 2 ms
5,248 KB |
testcase_55 | AC | 2 ms
5,248 KB |
testcase_56 | AC | 1 ms
5,248 KB |
testcase_57 | AC | 1 ms
5,248 KB |
ソースコード
#include "bits/stdc++.h"#include <stdio.h>#include <math.h>#include "atcoder/all"#include <float.h>#include <boost/multiprecision/cpp_int.hpp>using namespace boost::multiprecision;using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using vd = vector<double>;using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>; using vvm = vector<vm>;void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end()? V() : mp.at(key); }long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }struct ct {vector<int> c;int t;};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n, m;cin >> n >> m;vector<int> x(m);REP(i, m) {cin >> x[i];x[i] *= 100;}vector<ct> vct(n);map<vector<int>, vector<int>> mp;REP(i, n) {vct[i].c.resize(m);REP(j, m) {cin >> vct[i].c[j];}cin >> vct[i].t;vector<int> add(m, 0);REP(j, m) add[j] = vct[i].c[j] * vct[i].t;mp[add].push_back(i);}bool ok = false;REP(i, n) {vector<int> ov(m);REP(j, m) ov[j] = x[j] - (vct[i].t * vct[i].c[j]);if (vct[i].t == 100) {bool tok = true;REP(i, m) if (ov[i] != 0) tok = false;if (tok) {ok = true;break;}}bool tok = true;REP(j, m) if (ov[j] % (100 - vct[i].t) != 0) tok = false;if (!tok) continue;REP(j, m) ov[j] /= (100 - vct[i].t);REP(j, m) ov[j] *= 100;auto it = mp.find(ov);if (it != mp.end() &&!(it->second.size() == 1 && it->second[0] == i)) {ok = true;}}yn(ok);}