oj.uz

Submission #364999

# Submission time Handle Problem Language Result Execution time Memory
364999 2021-02-10T17:37:58 Z ssense Costinland (info1cup19_costinland) C++14
71.589 / 100
 1 ms 224 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

int ceildiv(int one, int two) {
	if (one % two == 0) {return one / two;}
	else {return one / two + 1;}
} int power(int n, int pow, int m) {
	if (pow == 0) return 1;
	if (pow % 2 == 0) {
		ll x = power(n, pow / 2, m);
		return (x * x) % m;
	}
	else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
	if (!b)return a;
	return gcd(b, a % b);
} int factorial(int n, int mod) {
	if (n > 1)
		return (n * factorial(n - 1, mod)) % mod;
	else
		return 1;
} int lcm(int a, int b) {
	return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}vector<vector<int>> adj;void init(int n) {for (int i = 0; i <= n; i++) { vector<int> a; adj.pb(a);}}


int32_t main(){
	startt;
	//freopen("algsort.in", "r", stdin);
	//freopen("algsort.out", "w", stdout);
	int k;
	cin >> k;
	vint bin;
	bool check = false;
	while(k > 0)
	{
		if(k%2 == 1)
		{
			bin.pb(1);
		}
		else
		{
			check = true;
			bin.pb(0);
		}
		k/=2;
	}
	if(bin[bin.size()-2] == 1)
	{
		int n = bin.size();
		cout << n+1 << " " << n+1 << endl;
		char a[n+1][n+1];
		for(int i = 0; i < n+1; i++)
		{
			for(int j = 0; j < i; j++)
			{
				a[i][j] = 'd';
			}
			for(int j = i; j < n+1; j++)
			{
				a[i][j] = 'r';
			}
		}
		a[n][n] = '.';
		for(int i = 0; i < n-1; i++)
		{
			a[i][i] = 'X';
			a[i][i+1] = 'd';
			a[i+1][i] = 'r';
		}
		for(int i = 0; i < n; i++)
		{
			a[n][i] = 'r';
		}
		for(int i = 0; i < n; i++)
		{
			a[i][n] = 'd';
		}
		for(int i = 0; i < n-1; i++)
		{
			if(bin[i] == 1)
			{
				a[i+1][i] = 'X';
			}
		}
		for(int i = 0; i < n+1; i++)
		{
			for(int j = 0; j < n+1; j++)
			{
				cout << a[i][j];
			}
			cout << endl;
		}
	}
	else
	{
		int n = bin.size();
		cout << n << " " << n << endl;
		char a[n][n];
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < i; j++)
			{
				a[i][j] = 'd';
			}
			for(int j = i; j < n; j++)
			{
				a[i][j] = 'r';
			}
		}
		a[n-1][n-1] = '.';
		for(int i = 0; i < n-1; i++)
		{
			a[i][i] = 'X';
			a[i][i+1] = 'd';
			a[i+1][i] = 'r';
		}
		for(int i = 0; i < n-1; i++)
		{
			a[n-1][i] = 'r';
		}
		for(int i = 0; i < n-1; i++)
		{
			a[i][n-1] = 'd';
		}
		for(int i = 0; i < n-1; i++)
		{
			if(bin[i] == 1)
			{
				a[i+1][i] = 'X';
			}
		}
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				cout << a[i][j];
			}
			cout << endl;
		}
	}
}

Compilation message

costinland.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
costinland.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
costinland.cpp: In function 'int32_t main()':
costinland.cpp:57:7: warning: variable 'check' set but not used [-Wunused-but-set-variable]
   57 |  bool check = false;
      |       ^~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory 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: 4
5 Correct 1 ms 204 KB Correct! Your size: 4
6 Correct 1 ms 204 KB Correct! Your size: 4
7 Correct 1 ms 204 KB Correct! Your size: 4
8 Correct 1 ms 204 KB Correct! Your size: 5
9 Correct 1 ms 204 KB Correct! Your size: 5

Subtask #2
51.589012952 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Partially Correct! Your size: 59
2 Partially correct 1 ms 204 KB Partially Correct! Your size: 59
3 Partially correct 1 ms 224 KB Partially Correct! Your size: 60
4 Partially correct 1 ms 204 KB Partially Correct! Your size: 60
5 Partially correct 1 ms 204 KB Partially Correct! Your size: 60
6 Partially correct 1 ms 204 KB Partially Correct! Your size: 61
7 Partially correct 1 ms 204 KB Partially Correct! Your size: 61
8 Partially correct 1 ms 204 KB Partially Correct! Your size: 58