oj.uz

Submission #401019

# Submission time Handle Problem Language Result Execution time Memory
401019 2021-05-09T07:47:10 Z dolphingarlic Costinland (info1cup19_costinland) C++14
12 / 100
 1 ms 460 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

char grid[49][49];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll k;
    cin >> k;
    int w = (k <= 19 ? 6 : 61);

    for (int i = 0; i < w; i++)
        for (int j = 0; j < w; j++) grid[i][j] = '.';
    grid[0][0] = 'r';
    for (int i = 0; i < w - 1; i++) {
        grid[i][w - 1] = 'd';
        grid[w - 1][i] = 'r';
    }
    for (int i = 1; i < w - 1; i++)
        for (int j = 0; j < w - 1 - i; j++)
            grid[i][j] = 'X';
    
    for (int i = 0; i < w - 1; i++)
        if (k & (1ll << i)) grid[0][w - 2 - i] = 'X';
    for (int i = w - 2; ~i; i--)
        if (grid[0][i] == 'X') {
            grid[0][i] = 'd';
            break;
        }
    
    cout << w << ' ' << w << '\n';
    for (int i = 0; i < w; i++) {
        for (int j = 0; j < w; j++) cout << grid[i][j];
        cout << '\n';
    }
    return 0;
}

Subtask #1
12.0 / 20.0

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

Subtask #2
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -