結果
問題 | No.2414 2 KA 3 KA |
ユーザー |
![]() |
提出日時 | 2023-08-12 13:31:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 10,445 bytes |
コンパイル時間 | 2,139 ms |
コンパイル使用メモリ | 198,660 KB |
最終ジャッジ日時 | 2025-02-16 02:54:09 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 28 |
ソースコード
#include <bits/stdc++.h>using namespace std;using pint = pair<int, int>;using pll = pair<long long, long long>;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; }#define REP(i, n) for (long long i = 0; i < (long long)(n); ++i)#define REP2(i, a, b) for (long long i = a; i < (long long)(b); ++i)#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endltemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P){ return s << '<' << P.first << ", " << P.second << '>'; }template<class T> ostream& operator << (ostream &s, vector<T> P){ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }template<class T> ostream& operator << (ostream &s, deque<T> P){ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }template<class T> ostream& operator << (ostream &s, vector<vector<T> > P){ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }template<class T> ostream& operator << (ostream &s, set<T> P){ for(auto it : P) { s << "<" << it << "> "; } return s; }template<class T> ostream& operator << (ostream &s, multiset<T> P){ for(auto it : P) { s << "<" << it << "> "; } return s; }template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P){ for(auto it : P) { s << "<" << it.first << "->" << it.second << "> "; } return s; }/*///////////////////////////////////////////////////////*/// Union-Find, modint, segtree, lazy segtree/*///////////////////////////////////////////////////////*/// 4-neighbor (or 8-neighbor)const vector<int> dx = {1, 0, -1, 0, 1, -1, 1, -1};const vector<int> dy = {0, 1, 0, -1, 1, 1, -1, -1};// Union-Findstruct UnionFind {// core membervector<int> par;// constructorUnionFind() { }UnionFind(int n) : par(n, -1) { }void init(int n) { par.assign(n, -1); }// core methodsint root(int x) {if (par[x] < 0) return x;else return par[x] = root(par[x]);}bool same(int x, int y) {return root(x) == root(y);}bool merge(int x, int y) {x = root(x), y = root(y);if (x == y) return false;if (par[x] > par[y]) swap(x, y); // merge techniquepar[x] += par[y];par[y] = x;return true;}int size(int x) {return -par[root(x)];}// debugfriend ostream& operator << (ostream &s, UnionFind uf) {map<int, vector<int>> groups;for (int i = 0; i < uf.par.size(); ++i) {int r = uf.root(i);groups[r].push_back(i);}for (const auto &it : groups) {s << "group: ";for (auto v : it.second) s << v << " ";s << endl;}return s;}};// modinttemplate<int MOD> struct Fp {// inner valuelong long val;// constructorconstexpr Fp() noexcept : val(0) { }constexpr Fp(long long v) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr long long get() const noexcept { return val; }constexpr int get_mod() const noexcept { return MOD; }// arithmetic operatorsconstexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp &r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp &r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp &r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp &r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp &r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp &r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp &r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp &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 Fp pow(long long n) const noexcept {Fp res(1), mul(*this);while (n > 0) {if (n & 1) res *= mul;mul *= mul;n >>= 1;}return res;}constexpr Fp inv() const noexcept {Fp res(1), div(*this);return res / div;}// other operatorsconstexpr bool operator == (const Fp &r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp &r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream &is, Fp<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 Fp<MOD> &x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &r, long long n) noexcept {return r.pow(n);}friend constexpr Fp<MOD> modinv(const Fp<MOD> &r) noexcept {return r.inv();}};// Binomial coefficienttemplate<class T> struct BiCoef {vector<T> fact_, inv_, finv_;constexpr BiCoef() {}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {init(n);}constexpr void init(int n) noexcept {fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].get_mod();for(int i = 2; i < n; i++){fact_[i] = fact_[i-1] * i;inv_[i] = -inv_[MOD%i] * (MOD/i);finv_[i] = finv_[i-1] * inv_[i];}}constexpr T com(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[k] * finv_[n-k];}constexpr T fact(int n) const noexcept {if (n < 0) return 0;return fact_[n];}constexpr T inv(int n) const noexcept {if (n < 0) return 0;return inv_[n];}constexpr T finv(int n) const noexcept {if (n < 0) return 0;return finv_[n];}};// Segment Treetemplate<class Monoid> struct SegTree {using Func = function<Monoid(Monoid, Monoid)>;// core memberint SIZE;Func F;Monoid IDENTITY;// dataint offset;vector<Monoid> dat;// constructorSegTree() {}SegTree(int n, const Func &f, const Monoid &identity): SIZE(n), F(f), IDENTITY(identity) {offset = 1;while (offset < n) offset *= 2;dat.assign(offset * 2, IDENTITY);}void init(int n, const Func &f, const Monoid &identity) {SIZE = n;F = f;IDENTITY = identity;offset = 1;while (offset < n) offset *= 2;dat.assign(offset * 2, IDENTITY);}int size() const { return SIZE; }// set, a is 0-indexed //// build(): O(N)void set(int a, const Monoid &v) { dat[a + offset] = v; }void build() {for (int k = offset - 1; k > 0; --k)dat[k] = F(dat[k*2], dat[k*2+1]);}void build(const vector<Monoid> &vec) {for (int a = 0; a < vec.size() && a + offset < dat.size(); ++a)set(a, vec[a]);build();}// update a, a is 0-indexed, O(log N)void update(int a, const Monoid &v) {int k = a + offset;dat[k] = v;while (k >>= 1) dat[k] = F(dat[k*2], dat[k*2+1]);}// get [a, b), a and b are 0-indexed, O(log N)Monoid get(int a, int b) {Monoid vleft = IDENTITY, vright = IDENTITY;for (int left = a + offset, right = b + offset; left < right;left >>= 1, right >>= 1) {if (left & 1) vleft = F(vleft, dat[left++]);if (right & 1) vright = F(dat[--right], vright);}return F(vleft, vright);}Monoid get_all() { return dat[1]; }Monoid operator [] (int a) const { return dat[a + offset]; }// get max r that f(get(l, r)) = True (0-indexed), O(log N)// f(IDENTITY) need to be Trueint max_right(const function<bool(Monoid)> f, int l = 0) {if (l == SIZE) return SIZE;l += offset;Monoid sum = IDENTITY;do {while (l % 2 == 0) l >>= 1;if (!f(F(sum, dat[l]))) {while (l < offset) {l = l * 2;if (f(F(sum, dat[l]))) {sum = F(sum, dat[l]);++l;}}return l - offset;}sum = F(sum, dat[l]);++l;} while ((l & -l) != l); // stop if l = 2^ereturn SIZE;}// get min l that f(get(l, r)) = True (0-indexed), O(log N)// f(IDENTITY) need to be Trueint min_left(const function<bool(Monoid)> f, int r = -1) {if (r == 0) return 0;if (r == -1) r = SIZE;r += offset;Monoid sum = IDENTITY;do {--r;while (r > 1 && (r % 2)) r >>= 1;if (!f(F(dat[r], sum))) {while (r < offset) {r = r * 2 + 1;if (f(F(dat[r], sum))) {sum = F(dat[r], sum);--r;}}return r + 1 - offset;}sum = F(dat[r], sum);} while ((r & -r) != r);return 0;}// debugfriend ostream& operator << (ostream &s, const SegTree &seg) {for (int i = 0; i < seg.size(); ++i) {s << seg[i];if (i != seg.size()-1) s << " ";}return s;}};int main() {cin.tie(0);ios::sync_with_stdio(false);int A, B, C;cin >> A >> B >> C;int X = (A * B + B * C + C * A) * 2;int Y = A * B * C;if (X > Y) cout << 2 << endl;else cout << 3 << endl;}