結果
問題 | No.1122 Plane Tickets |
ユーザー | heno239 |
提出日時 | 2020-07-22 22:06:13 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,171 bytes |
コンパイル時間 | 963 ms |
コンパイル使用メモリ | 114,192 KB |
実行使用メモリ | 19,432 KB |
最終ジャッジ日時 | 2024-06-22 18:10:47 |
合計ジャッジ時間 | 2,549 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
19,308 KB |
testcase_01 | AC | 6 ms
19,180 KB |
testcase_02 | AC | 6 ms
19,300 KB |
testcase_03 | AC | 6 ms
19,172 KB |
testcase_04 | AC | 6 ms
19,176 KB |
testcase_05 | AC | 5 ms
19,304 KB |
testcase_06 | AC | 7 ms
19,304 KB |
testcase_07 | AC | 6 ms
19,172 KB |
testcase_08 | AC | 6 ms
19,180 KB |
testcase_09 | AC | 6 ms
19,176 KB |
testcase_10 | AC | 5 ms
19,172 KB |
testcase_11 | AC | 6 ms
19,304 KB |
testcase_12 | AC | 6 ms
19,304 KB |
testcase_13 | AC | 6 ms
19,432 KB |
testcase_14 | AC | 5 ms
19,176 KB |
testcase_15 | AC | 6 ms
19,304 KB |
testcase_16 | AC | 5 ms
19,304 KB |
testcase_17 | AC | 5 ms
19,300 KB |
testcase_18 | AC | 6 ms
19,308 KB |
testcase_19 | AC | 5 ms
19,172 KB |
testcase_20 | AC | 6 ms
19,176 KB |
testcase_21 | AC | 6 ms
19,172 KB |
testcase_22 | AC | 5 ms
19,176 KB |
testcase_23 | AC | 6 ms
19,304 KB |
testcase_24 | WA | - |
testcase_25 | AC | 6 ms
19,176 KB |
testcase_26 | AC | 6 ms
19,308 KB |
testcase_27 | AC | 6 ms
19,304 KB |
testcase_28 | WA | - |
testcase_29 | AC | 5 ms
19,300 KB |
testcase_30 | AC | 6 ms
19,300 KB |
testcase_31 | AC | 5 ms
19,300 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 7 ms
19,172 KB |
testcase_35 | AC | 6 ms
19,304 KB |
testcase_36 | AC | 7 ms
19,308 KB |
testcase_37 | AC | 6 ms
19,300 KB |
testcase_38 | AC | 6 ms
19,172 KB |
testcase_39 | AC | 6 ms
19,308 KB |
testcase_40 | AC | 5 ms
19,304 KB |
testcase_41 | AC | 5 ms
19,172 KB |
testcase_42 | AC | 6 ms
19,304 KB |
testcase_43 | AC | 6 ms
19,304 KB |
testcase_44 | AC | 6 ms
19,304 KB |
testcase_45 | AC | 5 ms
19,300 KB |
testcase_46 | AC | 6 ms
19,304 KB |
testcase_47 | AC | 7 ms
19,304 KB |
testcase_48 | AC | 6 ms
19,300 KB |
testcase_49 | WA | - |
testcase_50 | AC | 5 ms
19,304 KB |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n,ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1010000; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } void solve(){ ll c[5]; rep(i, 5)cin >> c[i]; ll ans = INF; rep(i, 3 * 3 * 3 * 3 * 3) { vector<int> v(5); int cop = i; rep(j, 5) { v[j] = cop % 3; cop /= 3; } bool valid = true; rep(j, 5) { int s = 0; rep(k, 3) { s += v[(j + k) % 5]; } if (s < 2)valid = false; } if (valid) { ll z = 0; rep(j, 5)z += c[j] * v[j]; ans = min(ans, (z + 1) / 2); } } cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //cout << grandy(2, 3, false, false) << "\n"; //int t; cin >> t; rep(i, t) solve(); return 0; }