oj.uz

답안 #217389

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217389 2020-03-29T14:00:23 Z dimash241 Costinland (info1cup19_costinland) C++17
0 / 100
 1 ms 208 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

//# include <ext/pb_ds/assoc_container.hpp>
//# include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;
 
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
string a[50];
//	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//	shuffle(permutation.begin(), permutation.end(), rng);

int main () {
	ll k;
	cin >> k;
	ll pw = 1;
    while (pw * 6 <= k) {
        n++;
        pw *= 6;
    }
    n = n * 2 + 3;

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			a[i] += '.';
		}
	}
	
	for (int i = 0; i < n-1; ++i) {
		a[n-1][i] = 'r';
		a[i][n-1] = 'd';
	}

	for (int i = 0; i < n - 4; i += 2) {
		a[i][i] = a[i+1][i] = a[i][i+1] = a[i+1][i+1] = 'X';
		a[i][i+2] = a[i+1][i+2] = 'd';
		a[i+2][i] = a[i+2][i+1] = 'r';
		if (k % 6 == 1) {
			a[i+2][i] = 'X';
		}
		if (k % 6 == 2) {
		    a[i+2][i] = 'X';
		    a[i][i+2] = 'X';
		}
		if (k % 6 == 3) {
			a[i+2][i+1] = 'X';
			a[i][i+2] = 'X';
		}
		if (k % 6 == 4) {
			a[i+2][i+1] = 'X';
			a[i+1][i+2] = 'X';
		}
		if (k % 6 == 5) {
			a[i][i+2] = 'X';
			a[i+1][i+2] = 'X';
			a[i+2][i] = 'X';
		}
		k /= 6;
	}

	int lst = n-3;
//	cout << k << '\n';

	if (k == 2) {
		a[lst][lst] = 'X';
	}
	if (k == 3) {
		a[lst+1][lst] = 'X';
		a[lst][lst] = 'X';
	}
	if (k == 4) {
		a[lst][lst] = a[lst][lst+1] = a[lst+1][lst] = 'X';
	}
	if (k == 5) {
		a[lst][lst] = a[lst+1][lst+1] = a[lst+1][lst] = 'X';
		a[lst][lst+1] = 'd';
	}
//	cerr << test(n) << '\n';
	cout << n << ' ' << n << '\n';
	for (int i = 0; i < n; ++i)
		cout << a[i] << '\n';


	return Accepted;
}

// B...a

Subtask #1
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Correct! Your size: 3
2 Correct 1 ms 204 KB Correct! Your size: 3
3 Correct 1 ms 204 KB Correct! Your size: 3
4 Correct 1 ms 204 KB Correct! Your size: 5
5 Correct 1 ms 204 KB Correct! Your size: 5
6 Correct 1 ms 204 KB Correct! Your size: 5
7 Incorrect 1 ms 208 KB The matrix does not generate the required number of Costins
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB The matrix does not generate the required number of Costins
2 Halted 0 ms 0 KB -