#138965 (C++14) No.466 ジオラマ

提出ソース

結果

問題	No.466 ジオラマ
ユーザー	shimomire
提出日時	2016-12-16 00:57:01
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,550 bytes
コンパイル時間	1,201 ms
コンパイル使用メモリ	126,216 KB
実行使用メモリ	4,508 KB
最終ジャッジ日時	2023-08-20 08:27:01
合計ジャッジ時間	13,008 ms
ジャッジサーバーID （参考情報）	judge15 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	2 ms 4,376 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	1 ms 4,376 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	2 ms 4,376 KB
testcase_38	WA	-
testcase_39	AC	2 ms 4,376 KB
testcase_40	WA	-
testcase_41	AC	2 ms 4,380 KB
testcase_42	WA	-
testcase_43	AC	2 ms 4,376 KB
testcase_44	WA	-
testcase_45	AC	2 ms 4,380 KB
testcase_46	WA	-
testcase_47	AC	2 ms 4,376 KB
testcase_48	WA	-
testcase_49	AC	2 ms 4,376 KB
testcase_50	WA	-
testcase_51	AC	2 ms 4,380 KB
testcase_52	WA	-
testcase_53	AC	2 ms 4,380 KB
testcase_54	WA	-
testcase_55	AC	2 ms 4,376 KB
testcase_56	WA	-
testcase_57	AC	2 ms 4,376 KB
testcase_58	WA	-
testcase_59	AC	2 ms 4,376 KB
testcase_60	WA	-
testcase_61	AC	2 ms 4,380 KB
testcase_62	WA	-
testcase_63	AC	2 ms 4,376 KB
testcase_64	WA	-
testcase_65	AC	1 ms 4,380 KB
testcase_66	WA	-
testcase_67	AC	2 ms 4,380 KB
testcase_68	WA	-
testcase_69	AC	2 ms 4,380 KB
testcase_70	WA	-
testcase_71	AC	1 ms 4,376 KB
testcase_72	WA	-
testcase_73	AC	1 ms 4,376 KB
testcase_74	WA	-
testcase_75	AC	2 ms 4,376 KB
testcase_76	AC	2 ms 4,376 KB
testcase_77	AC	2 ms 4,376 KB
testcase_78	AC	2 ms 4,376 KB
testcase_79	AC	2 ms 4,376 KB
testcase_80	AC	2 ms 4,376 KB
testcase_81	WA	-
testcase_82	AC	2 ms 4,376 KB
testcase_83	WA	-
testcase_84	WA	-
testcase_85	WA	-
testcase_86	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug==
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-12;};
template<> inline long double EPS<long double>(){return 1e-12;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

class Main{
	public:
	void run(){
		int A,B,C,D;cin >> A >> B >> C >> D;

		vector<pair<int,int>> res;
		ll N = INF<ll>();
		if(C == 0){
			for(int c:range(A-1)){
				res.push_back(make_pair(2*c,2*c+2));
			}
			for(int c:range(B-1)){
				res.push_back(make_pair(2*c+1,2*c+3));
			}
		}else if(A == C && B == C){
			if(C <= 1){
				cout << -1 << endl;return;
			}
			res.push_back({0,1});
			res.push_back({1,0});
			for(int c:range(C-2)){
				res.push_back({c,c*2});
			}
		}else{
			ll mid = (A == C)?0:(B == C)?1:INF<int>();
			for(int c:range(A-C-1)){
				res.push_back(make_pair(2*c,2*c+2));
			}
			if(A-C >= 1) res.push_back(make_pair(2*(A-C-1),mid));
 			for(int c:range(B-C-1)){
				res.push_back(make_pair(2*c+1,2*c+3));
			}
			if(B-C>=1) res.push_back(make_pair(2*(B-C-1)+1,mid));
			if(C >= 2){
				res.push_back(make_pair(mid,INF<int>()+1));
				for(int c:range(1,C-1)){
					res.push_back(make_pair(INF<int>()+c,INF<int>()+c+1));
				}
			}
		}
		if(res.size() <=D){
			cout << make_pair(N,res.size())<<endl;
			for(auto p:res){
				cout << p << endl;
			}
		}else{
			cout << -1 << endl;
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード