結果

問題 No.466 ジオラマ
ユーザー char134217728char134217728
提出日時 2017-09-15 06:50:17
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 2,928 bytes
コンパイル時間 1,459 ms
コンパイル使用メモリ 160,776 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 22:32:22
合計ジャッジ時間 5,678 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 83
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:40:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type]
   40 | main(){
      | ^~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
int oa, ob, md;
cin >> a >> b >> c >> d;
oa = a - c;
ob = b - c;
if(c == 0){
md = oa+ob-2;
if(d < md || md == 1){
cout << -1 << "\n";
}else{
cout << md+2 << " " << md << "\n";
FOR(i, 0, oa-1)cout << 0 << " " << 2+i << "\n";
FOR(i, 0, ob-1)cout << 1 << " " << oa+1+i << "\n";
}
return 0;
}
if(oa == 0 && ob == 0){
md = c;
if(d < md || md == 1){
cout << -1 << "\n";
}else{
cout << md << " " << md << "\n";
FOR(i, 0, md-1)cout << i << " " << i+1 << "\n";
cout << md-1 << " " << 0 << "\n";
}
return 0;
}
if(oa > 0 && ob == 0){
md = a-1;
if(d < md){
cout << -1 << "\n";
}else{
cout << a << " " << md << "\n";
cout << 0 << " " << 1 << "\n";
FOR(i, 0, oa-1)cout << 0 << " " << 2+i << "\n";
FOR(i, 0, c-1)cout << 1 << " " << oa+1+i << "\n";
}
return 0;
}
if(oa == 0 && ob > 0){
md = b-1;
if(d < md){
cout << -1 << "\n";
}else{
cout << b << " " << md << "\n";
cout << 1 << " " << 0 << "\n";
FOR(i, 0, ob-1)cout << 1 << " " << 2+i << "\n";
FOR(i, 0, c-1)cout << 0 << " " << ob+1+i << "\n";
}
return 0;
}
if(oa > 0 && ob > 0){
md = oa+ob+c-1;
if(d < md){
cout << -1 << "\n";
}else{
cout << md+1 << " " << md << "\n";
FOR(i, 0, oa-1)cout << 0 << " " << 2+i << "\n";
FOR(i, 0, ob-1)cout << 1 << " " << oa+1+i << "\n";
int cf = oa + ob;
cout << 0 << " " << cf << "\n";
cout << 1 << " " << cf << "\n";
FOR(i, 1, c)cout << cf << " " << cf+i << "\n";
}
return 0;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0