結果
問題 | No.968 引き算をして門松列(その3) |
ユーザー | satanic |
提出日時 | 2020-01-13 20:41:12 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 6,022 bytes |
コンパイル時間 | 1,449 ms |
コンパイル使用メモリ | 123,896 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-12-21 16:32:43 |
合計ジャッジ時間 | 1,530 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 3 ms
6,816 KB |
testcase_04 | AC | 4 ms
6,816 KB |
testcase_05 | AC | 3 ms
6,816 KB |
testcase_06 | AC | 4 ms
6,820 KB |
testcase_07 | AC | 4 ms
6,816 KB |
testcase_08 | AC | 6 ms
6,816 KB |
testcase_09 | AC | 7 ms
6,816 KB |
testcase_10 | AC | 8 ms
6,820 KB |
testcase_11 | AC | 7 ms
6,820 KB |
ソースコード
// need#include <iostream>#include <algorithm>// data structure#include <bitset>#include <map>#include <queue>#include <set>#include <stack>#include <string>#include <utility>#include <vector>#include <complex>//#include <deque>#include <valarray>#include <unordered_map>#include <unordered_set>#include <array>// etc#include <cassert>#include <cmath>#include <functional>#include <iomanip>#include <chrono>#include <random>#include <numeric>#include <fstream>// input#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_,__VA_ARGS__);}template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p,rest...); }#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;// outputtemplate<typename T>void MACRO_OUT(const T t) { std::cout << t; }template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }#define OUT(...) MACRO_OUT(__VA_ARGS__);#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);#define EOUT(...) { OUT(__VA_ARGS__)BR; exit(0); }#define SP std::cout<<" ";#define TAB std::cout<<"\t";#define BR std::cout<<"\n";#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');#define ENDL std::cout<<std::endl;#define FLUSH std::cout<<std::flush;#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << "\n";}#define SHOWVECTOR(v) {std::cerr << #v << "\t: ";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}// utility#define ALL(a) (a).begin(),(a).end()#define FOR(w, a, n) for(int w=(a);w<(n);++w)#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)#define REP(w, n) for(int w=0;w<int(n);++w)#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)#define IN(a, x, b) (a<=x && x<b)template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }// testtemplate<class T> using V = std::vector<T>;template<class T> using VV = V<V<T>>;template<typename S, typename T>std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {os << "(" << p.first << ", " << p.second << ")"; return os;}// type/const#define int llusing ll = long long;using ull = unsigned long long;using ld = long double;using PAIR = std::pair<int, int>;using PAIRLL = std::pair<ll, ll>;constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9constexpr ll INFLL = 1LL << 60; // 1.15x10^18constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18constexpr double eps = 1e-7;constexpr int MOD = 1000000007;constexpr double PI = 3.141592653589793238462643383279;template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }// ------------>8------------------------------------->8------------signed main() {INIT;VAR(int, Q);REP(_, Q) {VAR(int, A, B, C, x, y, z);int ans = INFLL;{// a<c<bint a = A, b = B, c = C;int sum = 0;if (c <= a) {int t = a - c + 1;a -= t;b -= t;sum += x * t;}if (b <= c) {int t = c - b + 1;a -= t;c -= t;sum += z * t;}if (a > 0 && b > 0 && c > 0) CHMIN(ans, sum);}{// c<a<bint a = A, b = B, c = C;int sum = 0;if (a <= c) {int t = c - a + 1;b -= t;c -= t;sum += y * t;}if (b <= a) {int t = a - b + 1;a -= t;c -= t;sum += z * t;}if (a > 0 && b > 0 && c > 0) CHMIN(ans, sum);}{// b<a<cint a = A, b = B, c = C;int sum = 0;if (a <= b) {int t = b - a + 1;b -= t;c -= t;sum += y * t;}if (c <= a) {int t = a - c + 1;a -= t;b -= t;sum += x * t;}if (a > 0 && b > 0 && c > 0) CHMIN(ans, sum);}{// b<c<aint a = A, b = B, c = C;int sum = 0;if (c <= b) {int t = b - c + 1;a -= t;b -= t;sum += x * t;}if (a <= c) {int t = c - a + 1;b -= t;c -= t;sum += y * t;}if (a > 0 && b > 0 && c > 0) CHMIN(ans, sum);}if (ans >= INFLL) ans = -1;OUT(ans)BR;}return 0;}