結果

問題 No.466 ジオラマ
ユーザー ysuzuki5321
提出日時 2020-01-10 11:49:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 12,731 bytes
コンパイル時間 1,786 ms
コンパイル使用メモリ 126,440 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-23 21:48:24
合計ジャッジ時間 6,684 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 75 WA * 8
権限があれば一括ダウンロードができます

ソースコード

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

#include <stdio.h>
#include <sstream>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <limits>
#include <iomanip>
#include <ctype.h>
#include <unordered_map>
#include <random>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> plpllgreaterq;
#define bit(x,v) ((ll)x << v)
const ll INF = 1000000007;
const int MAX = 310000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++) {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k) {
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}
int pr[200010];
int lank[200010];
void uini(int n) {
    for (size_t i = 0; i <= n; i++)
    {
        pr[i] = i;
    }
}
int parent(int x) {
    if (x == pr[x]) return x;
    return pr[x] = parent(pr[x]);
}
int same(int x, int y) {
    return parent(x) == parent(y);
}
bool unit(int x, int y) {
    int px = parent(x);
    int py = parent(y);
    if (px == py) return false;
    if (lank[px] < lank[py]) {
        pr[py] = px;
        lank[px] += lank[py] + 1;
    }
    else {
        pr[px] = py;
        lank[py] += lank[px] + 1;
    }
    return true;
}
ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {
    while (max_n >= x)
    {
        bit[x]++;
        x += x & -x;
    }
}
void sub(int x) {
    while (max_n >= x)
    {
        bit[x]--;
        x += x & -x;
    }
}
ll merge(ll* a, int left, int mid, int right) {
    ll n1 = mid - left;
    ll n2 = right - mid;
    vector<int> L(n1 + 1);
    vector<int> R(n2 + 1);
    for (size_t i = 0; i < n1; i++)
    {
        L[i] = a[left + i];
    }
    for (size_t i = 0; i < n2; i++)
    {
        R[i] = a[mid + i];
    }
    L[n1] = INF;
    R[n2] = INF;
    ll i = 0;
    ll j = 0;
    ll r = 0;
    for (size_t k = left; k < right; k++)
    {
        if (L[i] <= R[j]) {
            a[k] = L[i];
            i++;
        }
        else {
            a[k] = R[j];
            r += n1 - i;
            j++;
        }
    }
    return r;
}
ll merge2(pair<int, char>* a, int left, int mid, int right) {
    ll n1 = mid - left;
    ll n2 = right - mid;
    vector<pair<int, char>> L(n1 + 1);
    vector<pair<int, char>> R(n2 + 1);
    for (size_t i = 0; i < n1; i++)
    {
        L[i] = a[left + i];
    }
    for (size_t i = 0; i < n2; i++)
    {
        R[i] = a[mid + i];
    }
    L[n1] = make_pair(INF, ' ');
    R[n2] = make_pair(INF, ' ');
    ll i = 0;
    ll j = 0;
    ll r = 0;
    for (size_t k = left; k < right; k++)
    {
        if (L[i].first <= R[j].first) {
            a[k] = L[i];
            i++;
        }
        else {
            a[k] = R[j];
            r += n1 - i;
            j++;
        }
    }
    return r;
}
ll mergeSort2(pair<int, char>* a, int left, int right) {
    ll res = 0;
    if (left + 1 < right) {
        int mid = (left + right) / 2;
        res = mergeSort2(a, left, mid);
        res += mergeSort2(a, mid, right);
        res += merge2(a, left, mid, right);
    }
    return res;
}
ll mergeSort(ll* a, int left, int right) {
    ll res = 0;
    if (left + 1 < right) {
        int mid = (left + right) / 2;
        res = mergeSort(a, left, mid);
        res += mergeSort(a, mid, right);
        res += merge(a, left, mid, right);
    }
    return res;
}
int partition(pair<int, char>* a, int p, int r) {
    pair<int, char> x = a[r];
    int i = p - 1;
    for (size_t j = p; j < r; j++)
    {
        if (a[j].first <= x.first) {
            i++;
            swap(a[i], a[j]);
        }
    }
    swap(a[i + 1], a[r]);
    return i + 1;
}
void quick(pair<int, char>* a, int p, int r) {
    if (p < r) {
        int q = partition(a, p, r);
        quick(a, p, q - 1);
        quick(a, q + 1, r);
    }
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
    int key;
    int priority;
    Node* parent, * left, * right;
    Node(int key, int priority);
    Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
    left = &NIL;
    right = &NIL;
}
Node* root = new Node();
void cenrec(Node* k) {
    if (k->key == NIL.key) return;
    cenrec(k->left);
    cout << " " << k->key;
    cenrec(k->right);
}
void fastrec(Node* k)
{
    if (k->key == NIL.key) return;
    cout << " " << k->key;
    fastrec(k->left);
    fastrec(k->right);
}
void insert(Node* v) {
    Node* y = &NIL;
    Node* x = root;
    while (x->key != NIL.key)
    {
        y = x;
        if (v->key < x->key) {
            x = x->left;
        }
        else {
            x = x->right;
        }
    }
    v->parent = y;
    if (y->key == NIL.key) {
        root = v;
    }
    else if (v->key < y->key) {
        y->left = v;
    }
    else {
        y->right = v;
    }
}
Node* find(Node* k, ll v)
{
    if (k->key == NIL.key) return &NIL;
    if (k->key == v) return k;
    if (v < k->key) return find(k->left, v);
    return find(k->right, v);
}
void delp12(Node* x) {
    if (x->key == NIL.key)  return;
    Node* l = x->left;
    Node* r = x->right;
    Node* pr = x->parent;
    if (l->key == NIL.key
        && r->key == NIL.key) {
        if (pr->left == x) {
            pr->left = &NIL;
        }
        else pr->right = &NIL;
    }
    else if (l->key != NIL.key) {
        if (pr->left == x) {
            pr->left = l;
        }
        else pr->right = l;
        l->parent = pr;
    }
    else if (r->key != NIL.key) {
        if (pr->left == x) {
            pr->left = r;
        }
        else pr->right = r;
        r->parent = pr;
    }
}
Node* get_next(Node* k) {
    if (k->key == NIL.key) return &NIL;
    Node* res = get_next(k->left);
    if (res->key != NIL.key) return res;
    return k;
}
void del(Node* x) {
    if (x->key == NIL.key) return;
    Node* l = x->left;
    Node* r = x->right;
    Node* pr = x->parent;
    if (l->key != NIL.key && r->key != NIL.key) {
        Node* nex = get_next(r);
        x->key = nex->key;
        delp12(nex);
    }
    else {
        delp12(x);
    }
}
Node* rightRotate(Node* t) {
    Node* s = t->left;
    t->left = s->right;
    s->right = t;
    return s;
}
Node* leftRotate(Node* t) {
    Node* s = t->right;
    t->right = s->left;
    s->left = t;
    return s;
}
Node* _insert(Node* t, int key, int priority) {
    if (t->key == NIL.key) {
        return new Node(key, priority);
    }
    if (key == t->key) {
        return t;
    }
    if (key < t->key) {
        t->left = _insert(t->left, key, priority);
        if (t->priority < t->left->priority) {
            t = rightRotate(t);
        }
    }
    else {
        t->right = _insert(t->right, key, priority);
        if (t->priority < t->right->priority) {
            t = leftRotate(t);
        }
    }
    return t;
}
Node* delete1(Node* t, int key);
Node* _delete(Node* t, int key) {
    if (t->left->key == NIL.key && t->right->key == NIL.key) {
        return &NIL;
    }
    else if (t->left->key == NIL.key) {
        t = leftRotate(t);
    }
    else if (t->right->key == NIL.key) {
        t = rightRotate(t);
    }
    else
    {
        if (t->left->priority > t->right->priority) {
            t = rightRotate(t);
        }
        else
            t = leftRotate(t);
    }
    return delete1(t, key);
}
Node* delete1(Node* t, int key) {
    if (t->key == NIL.key) {
        return &NIL;
    }
    if (key < t->key) {
        t->left = delete1(t->left, key);
    }
    else if (key > t->key) {
        t->right = delete1(t->right, key);
    }
    else return _delete(t, key);
    return t;
}
int H;
int left(int i) {
    return i * 2 + 1;
}
int right(int i) {
    return i * 2 + 2;
}
ll heap[2000010];
void maxHeapify(int i) {
    int l = left(i);
    int r = right(i);
    int largest = 0;
    if (l < H && heap[l] > heap[i])
        largest = l;
    else
        largest = i;
    if (r < H && heap[r] > heap[largest])
        largest = r;
    if (largest != i) {
        swap(heap[i], heap[largest]);
        maxHeapify(largest);
    }
}
int pare(int i) {
    return (i - 1) / 2;
}
void raise(int i) {
    int l = pare(i);
    if (l < 0) return;
    if (heap[l] < heap[i]) {
        swap(heap[i], heap[l]);
        raise(l);
    }
}
void minHeapify(int i) {
    int l = left(i);
    int r = right(i);
    int minimam = 0;
    if (l < H && heap[l] < heap[i])
        minimam = l;
    else
        minimam = i;
    if (r < H && heap[r] < heap[minimam])
        minimam = r;
    if (minimam != i) {
        swap(heap[i], heap[minimam]);
        minHeapify(minimam);
    }
}
void buildMaxHeap() {
    for (int i = H / 2; i >= 0; i--)
    {
        maxHeapify(i);
    }
}
int dx[] = { -1,0,1,0 };
int dy[] = { 0,-1,0,1 };
std::vector<int> find_all(const std::string str, const std::string subStr) {
    std::vector<int> result;
    int subStrSize = subStr.size();
    int pos = str.find(subStr);
    while (pos != std::string::npos) {
        result.push_back(pos);
        pos = str.find(subStr, pos + 1);
    }
    return result;
}
//ll memo[100010];
//ll next[100010];
//ll dm[100010];
//int f[100010];
//ll rec(int x) {
//
//  if (~memo[x]) return memo[x];
//  if (x == n) { 
//      dm[n] = 1;
//      return 1; 
//  }
//  ll *res = &memo[x];
//  *res = 0;
//  set<int> st;
//  st.insert(f[x]);
//  for (int i = x + 1; i <= n; i++)
//  {
//      if (~memo[i]) {
//          *res += memo[i] + 1;
//          *res %= INF;
//          break;
//      }
//
//      *res += rec(i);
//      *res %= INF;
//      if (st.find(f[i]) != st.end()) {break; }
//      st.insert(f[i]);
//  }
//
//  return *res;
//}
#define bit(x,v) ((ll)x << v)
class BIT {
    static const int MAX_N = 200010;
public:
    BIT() { memset(bit, 0, sizeof(bit)); }
    int bit[MAX_N + 1], n;
    int sum(int i) {
        int s = 0;
        while (i > 0)
        {
            s += bit[i];
            i -= i & -i;
        }
        return s;
    }
    void add(int i, int x) {
        while (i <= n)
        {
            bit[i] += x;
            i += i & -i;
        }
    }
    void clear() {
        memset(bit, 0, sizeof(bit));
    }
    int a[MAX_N];
    void bable_swap_count() {
        ll ans = 0;
        for (size_t j = 0; j < n; j++)
        {
            ans += j - sum(a[j]);
            add(a[j], 1);
        }
        printf("%lld\n", ans);
    }
    int search(int s, int x) {
        ll half = (s + x) / 2;
        ll sh = sum(x);
        ll sl = sum(half);
        ll st = sum(s);
        if (sh - sl == 0) {
            return x;
        }
        if (sh - sl < x - half) {
            return search(half, x);
        }
        if (sl - st == 0) {
            return half;
        }
        if (sl - st < half - s) {
            return search(s, half);
        }
        return -1;
    }
    int lankSearch(int lank) {
        return lankSearch(lank, 0, MAX_N);
    }
    int lankSearch(int lank, int s, int t) {
        ll half = (s + t) / 2;
        ll v = sum(half);
        ll v1 = sum(t);
        ll v2 = sum(s);
        if (lank == 1) {
            if (s + 1 >= t) return t;
            else if (v - v2 > 0) {
                return lankSearch(lank, s, half);
            }
            else return lankSearch(lank, half, t);
        }
        if ((v - v2) < lank) {
            return lankSearch(lank - (v - v2), half, t);
        }
        if ((v - v2) >= lank) {
            return lankSearch(lank, s, half);
        }
        return -1;
    }
};
vector<ll> getp(ll n) {
    vector<ll> res;
    ll a = 2;
    if (n % 2 == 0) {
        res.push_back(2);
        while (n % 2 == 0)n /= 2;
    }
    for (ll i = 3; i * i <= n; i += 2)
    {
        if (n % i == 0) {
            res.push_back(i);
            while (n % i == 0)n /= i;
        }
    }
    if (n != 1) res.push_back(n);
    return res;
}
vector<ll> getp2(ll n) {
    vector<ll> res;
    ll a = 2;
    if (n % 2 == 0) {
        
        while (n % 2 == 0) { n /= 2; res.push_back(2);}
    }
    for (ll i = 3; i * i <= n; i += 2)
    {
        if (n % i == 0) {
            
            while (n % i == 0) { n /= i; res.push_back(i); }
        }
    }
    if (n != 1) res.push_back(n);
    return res;
}
vector<ll> getDivisors(ll n) {
    vector<ll> res;
    ll a = 2;
    res.push_back(1);
    for (ll i = 2; i * i <= n; i++)
    {
        if (n % i == 0) {
            res.push_back(i);
            if (n / i != i)
                res.push_back(n / i);
        }
    }
    return res;
}
struct ve {
public:
    vector<ve> child;
    int _t = INF;
    ve(int t):_t(t){}
    ve(ve _left, ve _right) {
        _t = _left._t + _right._t;
        child.push_back(_left);
        child.push_back(_right);
    }
    bool operator<(const ve &t) const {
        return _t > t._t;
    }
};
vector<bool> elas(ll n) {
    vector<bool> r(n);
    fill(r.begin(), r.end(), 1);
    r[0] = 0;
    r[1] = 0;
    for (ll i = 2; i * i < n; i++)
    {
        if (!r[i]) continue;
        ll ti = i * 2;
        while (ti < n)
        {
            r[ti] = false;
            ti += i;
        }
    }
    return r;
}
void solv() {
    
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    ll pd = d;
    vector<ll> gl[40010];
    ll e = 2;
    ll v[40010];
    memset(v, -1, sizeof(v));
    v[0] = 0;
    v[1] = 1;
    int al = a - c;
    for (int i = 0; i < al - 1; i++)
    {
        gl[0].push_back(e);
        v[e] = 0; e++;
        pd--;
    }
    int bl = b - c;
    for (int i = 0; i < bl - 1; i++)
    {
        gl[1].push_back(e);
        v[e] = 1; e++;
        pd--;
    }
    if (c > 0) {
        
        int bc = e;
        if (a == c && b == c) {
            gl[0].push_back(1);
            gl[1].push_back(0);
            pd -= 2;
        }
        else if (a == c) {
            gl[1].push_back(0);
            bc = 0;
            pd--;
        }
        else if (b == c) {
            gl[0].push_back(1);
            bc = 1;
            pd--;
        }
        else {
            gl[0].push_back(e);
            gl[1].push_back(e);
            v[e] = 2;
            e++; pd -= 2;
        }
        for (int i = 0; i < c - 1; i++)
        {
            gl[bc].push_back(e);
            v[e] = 2; e++;
            pd--;
        }
    }
    if (pd < 0) {
        cout << -1 << endl;
        return;
    }
    
    cout << e << " " << d - pd << endl;
    for (size_t i = 0; i < e; i++)
    {
        for (auto v : gl[i])
        {
            cout << i << " " << v << endl;
        }
    }
}
int main() {
    //COMinit();
    solv();
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0