Submission #2702775

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)

vector<vector<int>> G;

i64 X[100];

i64 Y[100];

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

int vis[100];

void rec(int v,int n,int before_cnt){
  vis[v] = 1;
  int cnt = -1;
  for(int to : G[v]){
    if(vis[to]) continue;
    cnt++;
    if(cnt == (before_cnt ^ 1)) cnt++;
    X[to] = X[v] + dx[cnt] * (1LL << n);
    Y[to] = Y[v] + dy[cnt] * (1LL << n);
    rec(to,n - 1,cnt);
  }
}

char ans[100][100];

void rec2(int v,int n,int before_cnt){

  ans[X[v]][Y[v]] = v + 'A';
  vis[v] = 1;
  int cnt = -1;
  for(int to : G[v]){
    if(vis[to]) continue;
    int ddx = (X[to] - X[v] > 0 ? 1 : -1);
    int ddy = (Y[to] - Y[v] > 0 ? 1 : -1);
    if(X[to] == X[v]) ddx = 0;
    if(Y[to] == Y[v]) ddy = 0;
    for(int x = X[v] + ddx,y = Y[v] + ddy;x != X[to] || y != Y[to];x += ddx,y += ddy){
      ans[x][y] = (ddx != 0 ? '|' : '-');
    }
    rec2(to,n - 1,cnt);
  }
}

int main(){

  rep(i,0,99){
    rep(j,0,99) ans[i][j] = '.';
  }
  int N;
  cin >> N;
  G.resize(N);

  rep(i,0,N - 2){
    char c,d;
    cin >> c >> d;
    int a,b;
    a = c - 'A';
    b = d - 'A';

    G[a].push_back(b);
    G[b].push_back(a);
  }

  rec(0,N,10);
  vector<i64> xs,ys;
  rep(i,0,N - 1){
    xs.push_back(X[i]);
    ys.push_back(Y[i]);
  }

  sort(xs.begin(),xs.end());
  sort(ys.begin(),ys.end());
  xs.erase(unique(xs.begin(),xs.end()),xs.end());
  ys.erase(unique(ys.begin(),ys.end()),ys.end());

  rep(i,0,N - 1){
    X[i] = lower_bound(xs.begin(),xs.end(),X[i]) - xs.begin();
    Y[i] = lower_bound(ys.begin(),ys.end(),Y[i]) - ys.begin();
    X[i] *= 2;
    Y[i] *= 2;
    vis[i] = 0;
  }

  rec2(0,N,10);

  cout << 100 << " " << 100 << endl;
  rep(i,0,99){
    rep(j,0,99){
      cout << ans[i][j];
    }
    cout << endl;
  }
}

Submission Info

Judge Result