oj.uz

답안 #1100747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100747 2024-10-14T15:19:32 Z Kirill22 Costinland (info1cup19_costinland) C++17
58.2466 / 100
 2 ms 844 KB 
#include "bits/stdc++.h"

using namespace std;

void solve() {
    long long k;
    cin >> k;
    int n = 500;
    vector<string> a(n, string(n, '.'));
    int x = 0, y = 0;
    while (1) {
        if (k <= 1) {
            // x, y
            for (int i = 0; i <= y; i++) {
                a[x + 1][i] = 'r';
            }
            for (int i = 0; i <= x; i++) {
                a[i][y + 1] = 'd';
            }
            break;
        }
        if (k < 6) {
            a[x][y] = 'X';
            k--;
            if (x < y) {
                x++;
            } else {
                y++;
            }
            continue;
        }
        if (k % 6 == 0) {
            a[x][y] = a[x + 1][y] = a[x + 1][y + 1] = a[x][y + 1] = 'X';
            a[x + 2][y] = a[x + 2][y + 1] = 'r';
            a[x][y + 2] = a[x + 1][y + 2] = 'd';
            x += 2, y += 2;
            k /= 6;
            continue;
        }
        a[x][y] = 'X';
        if (k % 6 == 1) {
            if (x < y) {
                x++;
            } else {
                y++;
            }
            k--;
        } else if (k % 6 == 2) {
            if (x < y) {
                x++;
            } else {
                y++;
            }
            k--;
        } else if (k % 6 == 3) {
            if (x < y) {
                x++;
            } else {
                y++;
            }
            k--;
        } else if (k % 6 == 4) {
            if (x < y) {
                x++;
            } else {
                y++;
            }
            k--;
        } else if (k % 6 == 5) {
            a[x + 1][y] = a[x][y + 1] = a[x + 1][y + 1] = 'X';
            if (x < y) {
                a[x + 2][y] = 'd';
                a[x + 2][y + 1] = 'r';
                x += 3;
            } else {
                a[x][y + 2] = 'r';
                a[x + 1][y + 2] = 'd';
                y += 3;
            }
            k -= k % 6;
        }
    }
    int N = 0, M = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (a[i][j] != '.') {
                N = max(N, i + 1);
                M = max(M, j + 1);
            }
        }
    }
    cout << N << " " << M << '\n';
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            cout << a[i][j];
        }
        cout << '\n';
    }
};

/*
XX
XX
 */

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Subtask #1
12.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Correct! Your size: 3
2 Correct 1 ms 592 KB Correct! Your size: 4
3 Correct 1 ms 592 KB Correct! Your size: 4
4 Correct 1 ms 592 KB Correct! Your size: 4
5 Correct 1 ms 592 KB Correct! Your size: 5
6 Correct 1 ms 592 KB Correct! Your size: 5
7 Partially correct 1 ms 592 KB Partially Correct! Your size: 6
8 Partially correct 1 ms 592 KB Partially Correct! Your size: 6
9 Partially correct 1 ms 592 KB Partially Correct! Your size: 6

Subtask #2
46.246575344 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 760 KB Partially Correct! Your size: 67
2 Partially correct 1 ms 844 KB Partially Correct! Your size: 71
3 Partially correct 1 ms 592 KB Partially Correct! Your size: 73
4 Partially correct 1 ms 592 KB Partially Correct! Your size: 70
5 Partially correct 2 ms 592 KB Partially Correct! Your size: 74
6 Partially correct 1 ms 592 KB Partially Correct! Your size: 78
7 Partially correct 1 ms 592 KB Partially Correct! Your size: 75
8 Partially correct 1 ms 592 KB Partially Correct! Your size: 67