Submission #1038516

---

Source Code Expand

#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

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

// Problem Specific Parameter:
int x[4096],y[4096];
//const int limit=6;
const int limit=12;

void dfs(int v,int d){
	if(d==limit) return;
	int total=(1<<d)-1;
	int cur=v;
	if(d>=1) cur-=(1<<d)-1;
	
	x[v]=total-cur,y[v]=cur;
	if(v>0){
		int dx=x[v]-x[(v-1)/2],dy=y[v]-y[(v-1)/2];
		int g=__gcd(abs(dx),abs(dy));
		dx/=g,dy/=g;
		x[v]=x[(v-1)/2]+dx,y[v]=y[(v-1)/2]+dy;
	}

	//cout << x[v] << " " << y[v] << endl;	

	assert(0 <=v and v<4095);
	assert(0<= x[v] and x[v]<=1000000000);
	assert(0<= y[v] and y[v]<=1000000000);
	
	dfs(2*v+1,d+1);
	cout << x[v] << " " << y[v] << endl;	
	dfs(2*v+2,d+1);

	/*
	if(d<limit-1){
		const int rate=100;
		printf("line(%d,%d,%d,%d);",rate*x[v],rate*y[v],rate*x[2*v+1],rate*y[2*v+1]);
		printf("line(%d,%d,%d,%d);",rate*x[v],rate*y[v],rate*x[2*v+2],rate*y[2*v+2]);
	}
	*/
}

int main(void){
	dfs(0,0);
	return 0;
}

Submission Info

Judge Result