제출 #315256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
315256		Seanliu	Costinland (info1cup19_costinland)	C++14	58.64 / 100	2 ms	204 KiB

costinland

#include <iostream>
#define int long long int
using namespace std;

int D;
const int maxN = 62;
char mp[maxN][maxN];

inline void solve(int D){
	for(int i = 0; i < maxN; i++){
		for(int j = 0; j < maxN; j++) mp[i][j] = '.';
	}
	for(int i = 0; i < maxN - 1; i++){
		mp[i][maxN - 1] = 'd';
		mp[maxN - 1][i] = 'r';
	}
	for(int i = 0; i < maxN - 1; i++){
		mp[i][i] = 'X';
		mp[i][i + 1] = 'd';
		mp[i + 1][i] = 'r';
	}

	for(int i = 0; i < maxN; i++){
		if((D >> i) & 1){
			if((D >> (i + 1)) == 0){
				for(int j = i; j < maxN - 1; j++){
					mp[j][j] = mp[j][j + 1] = mp[j + 1][j] = '.';
				}
			} else mp[i][i + 1] = 'X';
		}
	}
	for(int i = 0; i < maxN - 1; i++){
		mp[i][maxN - 1] = 'd';
		mp[maxN - 1][i] = 'r';
	}

	cout << maxN << " " << maxN << endl;
	for(int i = 0; i < maxN; i++){
		for(int j = 0; j < maxN; j++){
			cout << mp[i][j];
		}
		cout << endl;
	}
}

signed main(){
	cin >> D;
	solve(D);
}

• Subtask 1: 10.639676114 / 20
• Subtask 2: 48 / 80