結果
問題 | No.91 赤、緑、青の石 |
ユーザー | h-izu |
提出日時 | 2023-01-27 01:41:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 67 ms / 5,000 ms |
コード長 | 6,555 bytes |
コンパイル時間 | 4,696 ms |
コンパイル使用メモリ | 277,600 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-27 15:26:08 |
合計ジャッジ時間 | 6,474 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
5,248 KB |
testcase_01 | AC | 31 ms
5,248 KB |
testcase_02 | AC | 20 ms
5,376 KB |
testcase_03 | AC | 35 ms
5,376 KB |
testcase_04 | AC | 18 ms
5,376 KB |
testcase_05 | AC | 41 ms
5,376 KB |
testcase_06 | AC | 6 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 13 ms
5,376 KB |
testcase_12 | AC | 38 ms
5,376 KB |
testcase_13 | AC | 42 ms
5,376 KB |
testcase_14 | AC | 28 ms
5,376 KB |
testcase_15 | AC | 45 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 67 ms
5,376 KB |
testcase_26 | AC | 63 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 45 ms
5,376 KB |
testcase_31 | AC | 61 ms
5,376 KB |
ソースコード
#ifdef __LOCAL#define _GLIBCXX_DEBUG#endif#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef unsigned long long ull;typedef long long ll;const double PI = 3.14159265358979323846;#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)// aよりもbが大きいならばaをbで更新する// (更新されたならばtrueを返す)template <typename T>bool chmax(T& a, const T& b) {if (a < b) {a = b; // aをbで更新return true;}return false;}// aよりもbが小さいならばaをbで更新する// (更新されたならばtrueを返す)template <typename T>bool chmin(T& a, const T& b) {if (a > b) {a = b; // aをbで更新return true;}return false;}// a^p// 2^3 = 2 * 2^2// 2^2 = 2 * (2^1)// 2^1 = 2ll modpow(ll a, ll p, ll mod) {if (p == 0) return 1;a %= mod;if (p % 2 == 0) {ll half = modpow(a, p / 2, mod) % mod;return half * half % mod;} else {return a * modpow(a, p - 1, mod) % mod;}}// a^pll powpow(ll a, ll p) {if (p == 0) return 1;if (p % 2 == 0) {ll half = pow(a, p / 2);return half * half;} else {return a * pow(a, p - 1);}}// a/b// https://qiita.com/drken/items/3b4fdf0a78e7a138cd9all moddiv(ll a, ll b, ll mod) { return a * modpow(b, mod - 2, mod); }// nCa を求めるll modCombination(ll n, ll a, ll mod) {if (n < 0 || a < 0 || n < a) return 0;if (n - a < a) {return modCombination(n, n - a, mod);}ll denominator = 1; // 分母ll numerator = 1; // 分子for (ll i = 0; i < a; i++) {denominator *= a - i;numerator *= n - i;denominator %= mod;numerator %= mod;}return numerator * modpow(denominator, mod - 2, mod) % mod;}vector<vector<ll>> combination(ll n) {vector<vector<ll>> C(n + 1, vector<ll>(n + 1));C[0][0] = 1;rep(i, n) rep(j, i + 1) {C[i + 1][j + 1] += C[i][j];C[i + 1][j] += C[i][j];}return C;}// ref. https://drken1215.hatenablog.com/entry/2018/06/08/210000class ModCombinationTable {private:ll mod;vector<ll> fac, finv, inv;public:ModCombinationTable(ll n, ll _mod) : mod(_mod) {fac.resize(n + 1);finv.resize(n + 1);inv.resize(n + 1);fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i <= n; i++) {fac[i] = fac[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}ll operator()(ll n, ll k) {if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % mod) % mod;}};// cf. https://qiita.com/drken/items/a14e9af0ca2d857dad23vector<ll> enum_divisors(ll n) {vector<ll> res;// sqrt(n)まで試し割りfor (ll i = 1; i * i <= n; i++) {if (n % i == 0) {res.push_back(i);// 重複しないならばiの相方であるn/iも約数// e.g. n=25のときのi=5は重複if (n / i != i) res.push_back(n / i);}}sort(res.begin(), res.end());return res;}// cf. https://qiita.com/drken/items/a14e9af0ca2d857dad23map<ll, ll> prime_factors(ll n) {map<ll, ll> res;// sqrt(n)まで試し割りfor (ll a = 2; a * a <= n; a++) {if (n % a != 0) continue;// nで割れる限り割るwhile (n % a == 0) {res[a]++;n /= a;}}if (n != 1) res[n]++;return res;}ll gcd(ll a, ll b) {if (b == 0)return a;elsereturn gcd(b, a % b);}ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }// p/qstruct fraction {ll p, q;fraction(ll _p = 0, ll _q = 1) : p(_p), q(_q) {if (q == 0) {p = 1;return;}if (q < 0) {p = -p;q = -q;}ll g = gcd(p, q);p /= g;q /= g;}bool operator<(const fraction& other) const {return p * other.q < q * other.p;}bool operator<=(const fraction& other) const {return p * other.q <= q * other.p;}bool operator==(const fraction& other) const {return p == other.p && q == other.q;}};// res[i][c] := i 文字目以降で最初に文字 c が登場する index (存在しないときは n)vector<vector<ll>> calcNext(const string& S) {ll n = (ll)S.size();vector<vector<ll>> res(n + 1, vector<ll>(26, n));for (ll i = n - 1; i >= 0; --i) {for (ll j = 0; j < 26; ++j) res[i][j] = res[i + 1][j];res[i][S[i] - 'a'] = i;}return res;}// ref. https://algo-logic.info/bridge-lowlink/struct LowLink {vector<vector<ll>> G;vector<ll> ord, low;vector<bool> visited;vector<pair<ll, ll>> bridges;LowLink(const vector<vector<ll>>& _G) : G(_G) {visited.resize(G.size(), false);ord.resize(G.size(), 0);low.resize(G.size(), 0);ll k = 0;rep(i, (ll)G.size()) {if (visited[i]) continue;k = dfs(i, k);}}ll dfs(ll node, ll k, ll parent = -1) {visited[node] = true;ord[node] = k;low[node] = k;k++;for (auto g : G[node]) {if (!visited[g]) {k = dfs(g, k, node);low[node] = min(low[node], low[g]);if (ord[node] < low[g]) {bridges.emplace_back(node, g);}} else if (g != parent) {low[node] = min(low[node], ord[g]);}}return k;}};// 3x3(アフィン変換)struct matrix {vector<vector<ll>> a;matrix(const vector<vector<ll>>& _a = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}}): a(_a) {}matrix operator*(const matrix& x) {matrix res({{0, 0, 0}, {0, 0, 0}, {0, 0, 0}});rep(i, 3) rep(j, 3) rep(k, 3) {// cout << i << "," << j << " <- " << a[i][k] << "*" << x.a[k][j] << endl;res.a[i][j] += a[i][k] * x.a[k][j];}return res;}vector<ll> operator*(const vector<ll>& x) {matrix other({{x[0], 0, 0}, {x[1], 0, 0}, {1, 0, 0}});auto res = *this * other;return vector<ll>({res.a[0][0], res.a[1][0], res.a[2][0]});}};int main() {cin.tie(nullptr);ios_base::sync_with_stdio(false);cout << fixed << setprecision(15);ll R, G, B;cin >> R >> G >> B;ll m1 = min({R, G, B});R -= m1;G -= m1;B -= m1;vector<ll> rgb;rgb.push_back(R);rgb.push_back(G);rgb.push_back(B);ll m2 = 0;while (true) {sort(rgb.begin(), rgb.end());ll v2 = rgb[1];ll v3 = rgb[2];if ((v2 - 1) < 0) break;if ((v3 - 3) < 0) break;m2++;rgb[1] = v2 - 1;rgb[2] = v3 - 3;}ll m3 = rgb[2] / 5;cout << m1 + m2 + m3 << endl;return 0;}