oj.uz

Submission #1009324

# Submission time Handle Problem Language Result Execution time Memory
1009324 2024-06-27T11:29:07 Z matere Costinland (info1cup19_costinland) C++14
71.589 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
long long k,n=64;
char a[65][65];
int main(){
    cin>>k;
    n=(int)log2(k)+2;
    if(k<=19) n=5;
    cout<<n<<' '<<n<<endl;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            a[i][j]='r';
        }
    }
    for(int i=1;i<n;i++) a[i][n]='d';
    a[n][n]='.';
    //
    for(int i=1;(1ll<<i)<=k;i++){
        a[i][i]='X';
        a[i][i+1]='d';
        if((1ll<<(i-1))&k) a[i][i+1]='X';
    }
    //
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<a[i][j];
        }
        cout<<endl;
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
51.589012952 / 80.0

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