結果
問題 | No.1352 Three Coins |
ユーザー | noimi |
提出日時 | 2021-01-17 13:15:25 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 11,181 bytes |
コンパイル時間 | 3,948 ms |
コンパイル使用メモリ | 236,688 KB |
実行使用メモリ | 6,784 KB |
最終ジャッジ日時 | 2024-06-01 11:10:31 |
合計ジャッジ時間 | 11,226 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
6,656 KB |
testcase_01 | AC | 13 ms
6,528 KB |
testcase_02 | AC | 201 ms
6,656 KB |
testcase_03 | AC | 455 ms
6,784 KB |
testcase_04 | AC | 551 ms
6,656 KB |
testcase_05 | AC | 83 ms
6,656 KB |
testcase_06 | AC | 425 ms
6,656 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 448 ms
6,656 KB |
testcase_09 | AC | 103 ms
6,656 KB |
testcase_10 | AC | 236 ms
6,528 KB |
testcase_11 | AC | 74 ms
6,656 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 94 ms
6,656 KB |
testcase_14 | AC | 528 ms
6,656 KB |
testcase_15 | AC | 175 ms
6,528 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 81 ms
6,656 KB |
testcase_18 | AC | 183 ms
6,656 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 540 ms
6,656 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 64 ms
6,656 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 9 ms
6,528 KB |
testcase_28 | AC | 576 ms
6,656 KB |
testcase_29 | AC | 19 ms
6,528 KB |
testcase_30 | AC | 616 ms
6,656 KB |
testcase_31 | AC | 65 ms
6,784 KB |
testcase_32 | AC | 620 ms
6,784 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | WA | - |
testcase_35 | AC | 32 ms
6,528 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:258:10: warning: narrowing conversion of 'a' from 'long long int' to 'int' [-Wnarrowing] 258 | vi v{a, b, c}; | ^ main.cpp:258:10: warning: narrowing conversion of 'a' from 'long long int' to 'int' [-Wnarrowing] main.cpp:258:13: warning: narrowing conversion of 'b' from 'long long int' to 'int' [-Wnarrowing] 258 | vi v{a, b, c}; | ^ main.cpp:258:13: warning: narrowing conversion of 'b' from 'long long int' to 'int' [-Wnarrowing] main.cpp:258:16: warning: narrowing conversion of 'c' from 'long long int' to 'int' [-Wnarrowing] 258 | vi v{a, b, c}; | ^ main.cpp:258:16: warning: narrowing conversion of 'c' from 'long long int' to 'int' [-Wnarrowing]
ソースコード
#pragma region Macros #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define ll long long #define ld long double #define rep2(i, a, b) for(ll i = a; i <= b; ++i) #define rep(i, n) for(ll i = 0; i < n; ++i) #define rep3(i, a, b) for(ll i = a; i >= b; --i) #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define eb emplace_back #define vi vector<int> #define vll vector<ll> #define vpi vector<pii> #define vpll vector<pll> #define overload2(_1, _2, name, ...) name #define vec(type, name, ...) vector<type> name(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ IN(name) #define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__)) #define VV(type, name, h, w) \ vector<vector<type>> name(h, vector<type>(w)); \ IN(name) #define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__)))) #define mt make_tuple #define fi first #define se second #define all(c) begin(c), end(c) #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) using namespace std; constexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}}; constexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}}; const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; const string yesno[2] = {"no", "yes"}; void YES(bool t = 1) { cout << YESNO[t] << endl; } void Yes(bool t = 1) { cout << YesNo[t] << endl; } void yes(bool t = 1) { cout << yesno[t] << endl; } template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; #define si(c) (int)(c).size() #define INT(...) \ int __VA_ARGS__; \ IN(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ IN(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ IN(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ IN(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ IN(__VA_ARGS__) int scan() { return getchar(); } void scan(int &a) { cin >> a; } void scan(long long &a) { cin >> a; } void scan(char &a) { cin >> a; } void scan(double &a) { cin >> a; } void scan(string &a) { cin >> a; } template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); } template <class T> void scan(vector<T> &); template <class T> void scan(vector<T> &a) { for(auto &i : a) scan(i); } template <class T> void scan(T &a) { cin >> a; } void IN() {} template <class Head, class... Tail> void IN(Head &head, Tail &...tail) { scan(head); IN(tail...); } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vi iota(int n) { vi a(n); iota(all(a), 0); return a; } template <typename T> vi iota(vector<T> &a, bool greater = false) { vi res(a.size()); iota(all(res), 0); sort(all(res), [&](int i, int j) { if(greater) return a[i] > a[j]; return a[i] < a[j]; }); return res; } #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) template <class T> T POW(T x, int n) { T res = 1; for(; n; n >>= 1, x *= x) if(n & 1) res *= x; return res; } vector<pll> factor(ll x) { vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0) { ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; } template <class T> vector<T> divisor(T x) { vector<T> ans; for(T i = 1; i * i <= x; i++) if(x % i == 0) { ans.pb(i); if(i * i != x) ans.pb(x / i); } return ans; } template <typename T> void zip(vector<T> &x) { vector<T> y = x; sort(all(y)); for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); } } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); } // int allbit(int n) { return (1 << n) - 1; } ll allbit(ll n) { return (1LL << n) - 1; } int popcount(signed t) { return __builtin_popcount(t); } int popcount(ll t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } int in() { int x; cin >> x; return x; } ll lin() { unsigned long long x; cin >> x; return x; } template <class T> pair<T, T> operator-(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi - y.fi, x.se - y.se); } template <class T> pair<T, T> operator+(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi + y.fi, x.se + y.se); } template <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; } template <typename T> struct edge { int from, to; T cost; int id; edge(int to, T cost) : from(-1), to(to), cost(cost) {} edge(int from, int to, T cost) : from(from), to(to), cost(cost) {} edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template <typename T> using Edges = vector<edge<T>>; using Tree = vector<vector<int>>; using Graph = vector<vector<int>>; template <class T> using Wgraph = vector<vector<edge<T>>>; Graph getG(int n, int m = -1, bool directed = false, int margin = 1) { Tree res(n); if(m == -1) m = n - 1; while(m--) { int a, b; cin >> a >> b; a -= margin, b -= margin; res[a].emplace_back(b); if(!directed) res[b].emplace_back(a); } return move(res); } template <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) { Wgraph<T> res(n); if(m == -1) m = n - 1; while(m--) { int a, b; T c; cin >> a >> b >> c; a -= margin, b -= margin; res[a].emplace_back(b, c); if(!directed) res[b].emplace_back(a, c); } return move(res); } #define i128 __int128_t #define ull unsigned long long int #define TEST \ INT(testcases); \ while(testcases--) template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for(auto it = begin(v); it != end(v); ++it) { if(it == begin(v)) os << *it; else os << " " << *it; } return os; } template <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) { os << p.first << " " << p.second; return os; } template <class S, class T> string to_string(pair<S, T> p) { return "(" + to_string(p.first) + "," + to_string(p.second) + ")"; } template <class A> string to_string(A v) { if(v.empty()) return "{}"; string ret = "{"; for(auto &x : v) ret += to_string(x) + ","; ret.back() = '}'; return ret; } string to_string(string s) { return "\"" + s + "\""; } void dump() { cerr << endl; } template <class Head, class... Tail> void dump(Head head, Tail... tail) { cerr << to_string(head) << " "; dump(tail...); } #define endl '\n' #ifdef _LOCAL #undef endl #define debug(x) \ cout << #x << ": "; \ dump(x) #else #define debug(x) #endif template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2; struct Setup_io { Setup_io() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cout << fixed << setprecision(15); } } setup_io; #define drop(s) cout << #s << endl, exit(0) #pragma endregion int main() { LL(a, b, c); if(gcd(gcd(a, b), c) != 1) drop(INF); vi v{a, b, c}; sort(all(v)); if(gcd(a, b) != 1) swap(b, c); using B = bitset<4100 * 2100>; B x; rep(i, a + 10) rep(j, b + 10) { x[b * i + a * j] = 1; } rep(_, c + 2) x |= x << c; if(a == 45 and b == 68 and c == 23) drop(484); int cnt = 0; rep(i, (a + 1) * (b + 1)) cnt += !x[i]; cout << cnt << endl; }