結果
問題 | No.967 引き算をして門松列(その2) |
ユーザー | yuruhiya |
提出日時 | 2020-01-13 21:19:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 8,725 bytes |
コンパイル時間 | 1,807 ms |
コンパイル使用メモリ | 186,132 KB |
最終ジャッジ日時 | 2025-01-08 17:43:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function ‘int gc()’: main.cpp:60:26: error: ‘_getchar_nolock’ was not declared in this scope; did you mean ‘getchar_unlocked’? 60 | #define getchar_unlocked _getchar_nolock | ^~~~~~~~~~~~~~~ main.cpp:63:34: note: in expansion of macro ‘getchar_unlocked’ 63 | inline int gc()noexcept { return getchar_unlocked(); } | ^~~~~~~~~~~~~~~~
ソースコード
#define _CRT_SECURE_NO_WARNINGS#include "bits/stdc++.h"#define rep(i, n) for(int i=0; i<(n); ++i)#define FOR(i, m, n) for(int i=(m); i<(n); ++i)#define rrep(i, n) for(int i=(n)-1; i>=0; --i)#define rfor(i, m, n) for(int i=(m); i>=(n); --i)#define sz(x) ((int)(x).size())#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define mp make_pair#define pb push_back#define eb emplace_backusing namespace std;using LL = long long; using ld = long double;using VB = vector<bool>; using VVB = vector<VB>;using VI = vector<int>; using VVI = vector<VI>;using VL = vector<LL>; using VVL = vector<VL>;using VS = vector<string>; using VD = vector<double>;using PII = pair<int, int>; using VP = vector<PII>;using PLL = pair<LL, LL>; using VPL = vector<PLL>;template<class T>using pq = priority_queue<T>;template<class T>using pqs = priority_queue<T, vector<T>, greater<T>>;constexpr int inf = (int)1e9;constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;const ld PI = acosl(-1.0), EPS = 1e-12;template<class T>inline void Sort(T& a)noexcept { sort(all(a)); }template<class T>inline void RSort(T& a)noexcept { sort(rall(a)); }template<class T>inline void Reverse(T& a)noexcept { reverse(all(a)); }template<class T>inline void Unique(T& a)noexcept { a.erase(unique(all(a)), a.end()); }template<class T>inline T Sorted(T a)noexcept { Sort(a); return a; }template<class T>inline T RSorted(T a)noexcept { RSort(a); return a; }template<class T>inline T Reversed(T a)noexcept { Reverse(a); return a; }template<class T>inline T Uniqued(T a)noexcept { Unique(a); return a; }template<class T>inline auto Max(const T& a)noexcept { return *max_element(all(a)); }template<class T>inline auto Min(const T& a)noexcept { return *min_element(all(a)); }template<class T>inline int MaxPos(const T& a)noexcept { return max_element(all(a)) - a.begin(); }template<class T>inline int MinPos(const T& a)noexcept { return min_element(all(a)) - a.begin(); }template<class T, class U>inline int Count(const T& a, const U& v)noexcept { return count(all(a), v); }template<class T, class U>inline int Find(const T& a, const U& v)noexcept { auto pos = find(all(a), v); return pos == a.end() ? -1 : pos - a.begin();}template<class T, class U>inline U Sum(const T& a, const U& v)noexcept { return accumulate(all(a), v); }template<class T, class U>inline int Lower(const T& a, const U& v)noexcept { return lower_bound(all(a), v) - a.begin(); }template<class T, class U>inline int Upper(const T& a, const U& v)noexcept { return upper_bound(all(a), v) - a.begin(); }template<class T, class P>inline void RemoveIf(T& a, P f)noexcept { a.erase(remove_if(all(a), f), a.end()); }template<class T>inline T Age(T n, T m)noexcept { return (n + m - 1) / m; }template<class T>inline T Age2(T n, T m)noexcept { return Age(n, m) * m; }template<class T>inline T Tri(T n)noexcept { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); }template<class T = long long>inline T BIT(int b)noexcept { return T{ 1 } << b; }template<class T>inline T Gcd(T n, T m)noexcept { return m ? Gcd(m, n % m) : n; }template<class T>inline T Lcm(T n, T m)noexcept { return n / Gcd(n, m) * m; }template<class T>inline T Pow(T a, T n)noexcept { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; }template<class T>inline T Powmod(T a, T n, T m = MOD)noexcept { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2;}return r; }template<class T>inline bool chmax(T& a, const T& b)noexcept { if (a < b) { a = b; return true; } return false; }template<class T>inline bool chmin(T& a, const T& b)noexcept { if (a > b) { a = b; return true; } return false; }inline string operator*(string s, int n)noexcept { string ret; rep(i, n)ret += s; return ret; }// --- input --- //#if defined(_MSC_VER) || defined(ONLINE_JUDGE)#define getchar_unlocked _getchar_nolock#define putchar_unlocked _putchar_nolock#endifinline int gc()noexcept { return getchar_unlocked(); }template<class T>inline void InputF(T& v)noexcept { cin >> v; }inline void InputF(char& v)noexcept { while (isspace(v = gc())); }inline void InputF(string& v)noexcept {char c; for (InputF(c); !isspace(c); c = gc())v += c;}inline void InputF(int& v)noexcept {bool neg = false; v = 0; char c; InputF(c);if (c == '-') { neg = true; c = gc(); }for (; isdigit(c); c = gc())v = v * 10 + (c - '0');if (neg)v = -v;}inline void InputF(long long& v)noexcept {bool neg = false; v = 0; char c; InputF(c);if (c == '-') { neg = true; c = gc(); }for (; isdigit(c); c = gc())v = v * 10 + (c - '0');if (neg)v = -v;}inline void InputF(double& v)noexcept {double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c);if (c == '-') { neg = true; c = gc(); }for (; isdigit(c) || c == '.'; c = gc()) {if (c == '.')adp = true;else if (adp)v += (c - '0') * (dp *= 0.1);else v = v * 10 + (c - '0');}if (neg)v = -v;}template<class T, class U>inline void InputF(pair<T, U>& v)noexcept {InputF(v.first); InputF(v.second);}template<class T>inline void InputF(vector<T>& v)noexcept {for (auto& e : v)InputF(e);}struct InputV {int n, m;InputV(int N) :n(N), m(0) {}InputV(pair<int, int> N) :n(N.first), m(N.second) {}template<class T>operator vector<T>()noexcept {vector<T> v(n); InputF(v); return v;}template<class T>operator vector<vector<T>>()noexcept {vector<vector<T>> v(n, vector<T>(m)); InputF(v); return v;}};struct Input {template<class T>operator T()noexcept { T v; InputF(v); return v; }int operator--(int) { int v; InputF(v); v--; return v; }InputV operator[](int n)noexcept { return InputV(n); }InputV operator[](pair<int, int> n)noexcept { return InputV(n); }template<class T, size_t W>array<vector<T>, W> get(int H) {array<vector<T>, W> ret;rep(i, H)rep(j, W) { T x = *this; ret[j].push_back(x); }return ret;}}in;// --- output --- //struct BoolStr {const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");struct DivStr {const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");class Output {BoolStr B{ Yes }; DivStr D{ spc }; bool isPrint = true;void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); }void p(int v) { printf("%d", v); } void p(LL v) { printf("%lld", v); }void p(char v) { putchar(v); } void p(bool v) { printf("%s", v ? B.t : B.f); }template<class T>void p(const T& v) { cout << v; }template<class T, class U>void p(const pair<T, U>& v) { p(v.first); printf("%s", D.d); p(v.second); }template<class T>void p(const vector<T>& v) { rep(i, sz(v)) { if (i)printf("%s", D.d); p(v[i]); } }template<class T>void p(const vector<vector<T>>& v) { rep(i, sz(v)) { if (i)printf("%s", D.l); p(v[i]); } }void p(const BoolStr& v) { B = v; isPrint = false; } void p(const DivStr& v) { D = v; isPrint = false; }public:void operator()() { printf("%s", D.l); }template<class H>void operator()(H&& h) {p(h); if (isPrint)printf("%s", D.l); isPrint = true; B = Yes; D = spc;}template<class H, class...T>void operator()(H&& h, T&& ...t) {p(h); if (isPrint)printf("%s", D.d); isPrint = true; operator()(forward<T>(t)...);}template<class...T>void exit(T&& ...t) {operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);}}out;// --- dump --- //#if __has_include("dump.hpp")#include "dump.hpp"#else#define dump(...) (void(0))#endif// ---------------------------------------------------------------- //bool check(LL a, LL b, LL c) {if (a <= 0 || b <= 0 || c <= 0 || a == b || b == c || a == c) {return false;} else if (a > b&& c > b) {return true;} else if (a < b && c < b) {return true;} else {return false;}}int main() {LL x = 0, y = 0, z = 0;// A < B && C < Bauto calc1 = [&](LL a, LL b, LL c) {LL res = 0;if (a >= b) { // a -> b-1res += x * (a - b + 1);a = b - 1;}if (c >= b) { // c -> b-1res += z * (c - b + 1);c = b - 1;}if (a == c) { // a -> a-1res += min(x, z);a--;}return check(a, b, c) ? res : inf_ll;};// A > B && C > Bauto calc2 = [&](LL a, LL b, LL c) {LL res = 0;if (a == c) { // a -> a-1res += min(x, z);a--;}if (min(a, c) <= b) { // b -> min(a,c)-1res += y * (b - min(a, c) + 1);b = min(a, c) - 1;}return check(a, b, c) ? res : inf_ll;};int t = in;rep(_, t) {LL a = in, b = in, c = in;x = in, y = in, z = in;LL ans = min(calc1(a, b, c), calc2(a, b, c));out(ans == inf_ll ? -1 : ans);}}