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

提出ソース

結果

問題	No.466 ジオラマ
ユーザー	shimomire
提出日時	2016-12-16 01:06:01
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	38 ms / 2,000 ms
コード長	5,752 bytes
コンパイル時間	1,356 ms
コンパイル使用メモリ	131,212 KB
実行使用メモリ	4,856 KB
最終ジャッジ日時	2023-08-20 08:30:50
合計ジャッジ時間	6,872 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	2 ms 4,384 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	19 ms 4,380 KB
testcase_07	AC	13 ms 4,380 KB
testcase_08	AC	28 ms 4,380 KB
testcase_09	AC	17 ms 4,376 KB
testcase_10	AC	20 ms 4,380 KB
testcase_11	AC	16 ms 4,380 KB
testcase_12	AC	23 ms 4,384 KB
testcase_13	AC	14 ms 4,380 KB
testcase_14	AC	11 ms 4,380 KB
testcase_15	AC	15 ms 4,376 KB
testcase_16	AC	2 ms 4,380 KB
testcase_17	AC	12 ms 4,380 KB
testcase_18	AC	14 ms 4,380 KB
testcase_19	AC	15 ms 4,376 KB
testcase_20	AC	15 ms 4,380 KB
testcase_21	AC	14 ms 4,380 KB
testcase_22	AC	19 ms 4,380 KB
testcase_23	AC	14 ms 4,384 KB
testcase_24	AC	22 ms 4,380 KB
testcase_25	AC	25 ms 4,396 KB
testcase_26	AC	14 ms 4,380 KB
testcase_27	AC	26 ms 4,380 KB
testcase_28	AC	19 ms 4,380 KB
testcase_29	AC	26 ms 4,380 KB
testcase_30	AC	18 ms 4,380 KB
testcase_31	AC	17 ms 4,376 KB
testcase_32	AC	17 ms 4,380 KB
testcase_33	AC	15 ms 4,380 KB
testcase_34	AC	19 ms 4,376 KB
testcase_35	AC	17 ms 4,380 KB
testcase_36	AC	10 ms 4,380 KB
testcase_37	AC	3 ms 4,380 KB
testcase_38	AC	12 ms 4,380 KB
testcase_39	AC	4 ms 4,380 KB
testcase_40	AC	16 ms 4,380 KB
testcase_41	AC	4 ms 4,380 KB
testcase_42	AC	15 ms 4,380 KB
testcase_43	AC	4 ms 4,380 KB
testcase_44	AC	13 ms 4,380 KB
testcase_45	AC	3 ms 4,380 KB
testcase_46	AC	7 ms 4,380 KB
testcase_47	AC	3 ms 4,380 KB
testcase_48	AC	19 ms 4,380 KB
testcase_49	AC	4 ms 4,380 KB
testcase_50	AC	16 ms 4,376 KB
testcase_51	AC	4 ms 4,380 KB
testcase_52	AC	15 ms 4,376 KB
testcase_53	AC	4 ms 4,376 KB
testcase_54	AC	15 ms 4,376 KB
testcase_55	AC	4 ms 4,376 KB
testcase_56	AC	5 ms 4,380 KB
testcase_57	AC	2 ms 4,380 KB
testcase_58	AC	3 ms 4,380 KB
testcase_59	AC	2 ms 4,380 KB
testcase_60	AC	6 ms 4,380 KB
testcase_61	AC	2 ms 4,376 KB
testcase_62	AC	6 ms 4,380 KB
testcase_63	AC	2 ms 4,380 KB
testcase_64	AC	4 ms 4,380 KB
testcase_65	AC	2 ms 4,376 KB
testcase_66	AC	21 ms 4,380 KB
testcase_67	AC	5 ms 4,380 KB
testcase_68	AC	14 ms 4,380 KB
testcase_69	AC	4 ms 4,376 KB
testcase_70	AC	11 ms 4,380 KB
testcase_71	AC	3 ms 4,380 KB
testcase_72	AC	9 ms 4,376 KB
testcase_73	AC	3 ms 4,376 KB
testcase_74	AC	16 ms 4,380 KB
testcase_75	AC	5 ms 4,376 KB
testcase_76	AC	5 ms 4,380 KB
testcase_77	AC	3 ms 4,380 KB
testcase_78	AC	4 ms 4,376 KB
testcase_79	AC	5 ms 4,380 KB
testcase_80	AC	4 ms 4,380 KB
testcase_81	AC	2 ms 4,380 KB
testcase_82	AC	2 ms 4,380 KB
testcase_83	AC	2 ms 4,380 KB
testcase_84	AC	20 ms 4,376 KB
testcase_85	AC	38 ms 4,856 KB
testcase_86	AC	2 ms 4,380 KB

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

ソースコード

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 add(int& id,map<ll,int>& vmap, vector<pair<int,int>>& res,int v1,int v2){
		if(!vmap.count(v1)) vmap[v1]=id++;
		if(!vmap.count(v2)) vmap[v2]=id++;
		res.push_back(make_pair(v1,v2));
	}
	void run(){
		int A,B,C,D;cin >> A >> B >> C >> D;

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

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

yukicoder

結果

テストケース

ソースコード