結果
問題 | No.466 ジオラマ |
ユーザー |
|
提出日時 | 2016-12-16 00:36:34 |
言語 | C++14 (gcc 8.3.0) |
結果 |
AC
|
実行時間 | 8 ms |
コード長 | 6,113 Byte |
コンパイル時間 | 1,095 ms |
使用メモリ | 1,544 KB |
最終ジャッジ日時 | 2019-12-04 15:10:49 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
challenge01.txt | AC | 4 ms
1,540 KB |
challenge02.txt | AC | 4 ms
1,536 KB |
sample01.txt | AC | 4 ms
1,536 KB |
sample02.txt | AC | 4 ms
1,536 KB |
sample03.txt | AC | 5 ms
1,536 KB |
sample04.txt | AC | 3 ms
1,528 KB |
test000.txt | AC | 6 ms
1,540 KB |
test001.txt | AC | 6 ms
1,544 KB |
test01.txt | AC | 6 ms
1,540 KB |
test02.txt | AC | 6 ms
1,544 KB |
test03.txt | AC | 5 ms
1,544 KB |
test04.txt | AC | 6 ms
1,540 KB |
test05.txt | AC | 6 ms
1,540 KB |
test06.txt | AC | 6 ms
1,544 KB |
test07.txt | AC | 4 ms
1,544 KB |
test08.txt | AC | 6 ms
1,540 KB |
test09.txt | AC | 3 ms
1,544 KB |
test10.txt | AC | 5 ms
1,536 KB |
test010.txt | AC | 6 ms
1,540 KB |
test11.txt | AC | 3 ms
1,544 KB |
test12.txt | AC | 6 ms
1,540 KB |
test13.txt | AC | 5 ms
1,540 KB |
test14.txt | AC | 4 ms
1,544 KB |
test15.txt | AC | 6 ms
1,544 KB |
test16.txt | AC | 6 ms
1,544 KB |
test17.txt | AC | 6 ms
1,540 KB |
test18.txt | AC | 4 ms
1,544 KB |
test19.txt | AC | 6 ms
1,540 KB |
test020.txt | AC | 8 ms
1,540 KB |
test20.txt | AC | 7 ms
1,540 KB |
test21.txt | AC | 5 ms
1,540 KB |
test22.txt | AC | 6 ms
1,540 KB |
test23.txt | AC | 5 ms
1,544 KB |
test24.txt | AC | 6 ms
1,544 KB |
test030.txt | AC | 4 ms
1,540 KB |
test040.txt | AC | 5 ms
1,540 KB |
test100.txt | AC | 4 ms
1,544 KB |
test101.txt | AC | 7 ms
1,536 KB |
test110.txt | AC | 5 ms
1,544 KB |
test111.txt | AC | 4 ms
1,536 KB |
test120.txt | AC | 6 ms
1,544 KB |
test121.txt | AC | 4 ms
1,528 KB |
test130.txt | AC | 6 ms
1,544 KB |
test131.txt | AC | 5 ms
1,528 KB |
test140.txt | AC | 5 ms
1,544 KB |
test141.txt | AC | 5 ms
1,532 KB |
test200.txt | AC | 5 ms
1,544 KB |
test201.txt | AC | 3 ms
1,532 KB |
test210.txt | AC | 6 ms
1,544 KB |
test211.txt | AC | 3 ms
1,532 KB |
test220.txt | AC | 5 ms
1,540 KB |
test221.txt | AC | 3 ms
1,528 KB |
test230.txt | AC | 6 ms
1,544 KB |
test231.txt | AC | 4 ms
1,528 KB |
test240.txt | AC | 3 ms
1,540 KB |
test241.txt | AC | 5 ms
1,532 KB |
test300.txt | AC | 5 ms
1,544 KB |
test301.txt | AC | 3 ms
1,528 KB |
test310.txt | AC | 4 ms
1,540 KB |
test311.txt | AC | 4 ms
1,528 KB |
test320.txt | AC | 5 ms
1,544 KB |
test321.txt | AC | 3 ms
1,528 KB |
test330.txt | AC | 5 ms
1,540 KB |
test331.txt | AC | 5 ms
1,532 KB |
test340.txt | AC | 5 ms
1,540 KB |
test341.txt | AC | 6 ms
1,528 KB |
test400.txt | AC | 7 ms
1,540 KB |
test401.txt | AC | 4 ms
1,536 KB |
test410.txt | AC | 5 ms
1,540 KB |
test411.txt | AC | 4 ms
1,528 KB |
test420.txt | AC | 4 ms
1,544 KB |
test421.txt | AC | 5 ms
1,536 KB |
test430.txt | AC | 5 ms
1,544 KB |
test431.txt | AC | 5 ms
1,528 KB |
test440.txt | AC | 6 ms
1,540 KB |
test441.txt | AC | 4 ms
1,528 KB |
text001.txt | AC | 4 ms
1,528 KB |
text011.txt | AC | 4 ms
1,528 KB |
text021.txt | AC | 4 ms
1,532 KB |
text031.txt | AC | 5 ms
1,528 KB |
text041.txt | AC | 4 ms
1,528 KB |
z001.txt | AC | 4 ms
1,532 KB |
z002.txt | AC | 5 ms
1,532 KB |
z003.txt | AC | 4 ms
1,540 KB |
z004.txt | AC | 6 ms
1,540 KB |
z005.txt | AC | 8 ms
1,540 KB |
z006.txt | AC | 3 ms
1,540 KB |
ソースコード
// need #include <iostream> #include <algorithm> // data structure #include <bitset> //#include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <utility> #include <vector> //#include <array> //#include <tuple> #include <unordered_map> #include <unordered_set> //#include <complex> //#include <deque> // stream //#include <istream> //#include <sstream> //#include <ostream> // etc #include <cassert> #include <functional> #include <iomanip> //#include <typeinfo> #include <chrono> #include <random> #include <cfenv> #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 i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __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 OUT(d) std::cout<<d; #define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d; #define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d; #define SP std::cout<<" "; #define TAB std::cout<<"\t"; #define BR std::cout<<"\n"; #define ENDL std::cout<<std::endl; #define FLUSH std::cout<<std::flush; #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& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<int(n);++i) #define RREP(i, n) for(int i=(n)-1;i>=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i) #define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i) #define REPLL(i, n) for(ll i=0;i<ll(n);++i) #define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i) #define PAIR std::pair<int, int> #define PAIRLL std::pair<ll, ll> #define IN(a, x, b) (a<=x && x<b) #define SHOW(d) {std::cerr << #d << "\t:" << d << "\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 SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";} #define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}} #define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";} #define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";} template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } #define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^19 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; signed main() { INIT; VAR(int, a, b, c, d); if (a == 1 && b == 1) { if (c != 0) { OUT(-1)BR; return 0; } OUT(2)SP OUT(0)BR; return 0; } if (a == b && b == c) { if (a > d) { OUT(-1)BR; return 0; } else { OUT(a)SP OUT(a)BR; OUT("0 1")BR; OUT("1 0")BR; REP(i, a - 2) { OUT(0)SP OUT(i + 2)BR; } return 0; } } else if (a == c && b != c) { if (b - 1 > d) { OUT(-1)BR; return 0; } else { OUT(b)SP OUT(b - 1)BR; OUT("1 0")BR; int p = 2; REP(i, a - 1) { OUT(0)SP OUT(p++)BR; } REP(i, b - a - 1) { OUT(1)SP OUT(p++)BR; } return 0; } } else if (b == c && a != c) { if (a - 1 > d) { OUT(-1)BR; return 0; } else { OUT(a)SP OUT(a - 1)BR; OUT("0 1")BR; int p = 2; REP(i, b - 1) { OUT(1)SP OUT(p++)BR; } REP(i, a - b - 1) { OUT(0)SP OUT(p++)BR; } return 0; } } else if (c == 0) { if (a + b - 2 > d) { OUT(-1)BR; return 0; } OUT(a + b)SP OUT(a + b - 2)BR; int p = 2; REP(i, a - 1) { OUT(0)SP OUT(p++)BR; } REP(i, b - 1) { OUT(1)SP OUT(p++)BR; } } else { if (a + b - c - 1 > d) { OUT(-1)BR; return 0; } else { OUT(a + b - c)SP OUT(a + b - c - 1)BR; OUT("0 2")BR; OUT("1 2")BR; int p = 3; REP(i, a - c - 1) { OUT(0)SP OUT(p++)BR; } REP(i, b - c - 1) { OUT(1)SP OUT(p++)BR; } REP(i, c - 1) { OUT(2)SP OUT(p++)BR; } return 0; } } return 0; }