oj.uz

답안 #1005168

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005168 2024-06-22T08:22:09 Z Nika533 Costinland (info1cup19_costinland) C++14
12 / 100
 0 ms 452 KB 
#pragma gcc diagnostic "-std=c++1z"
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
using namespace std;
int n,m,T,k;
void test_case() {
     n=61; m=61;
     cin>>k; 

     if (k<=19) {
          n=6; m=6;
     }
     
     k--;
     char arr[n+5][m+5];
     for (int i=1; i<=n; i++) {
          for (int j=1; j<=m; j++) {
               arr[i][j]='.';
          }
     }
     for (int i=1; i<=n-1; i++) arr[i][m]='d';
     for (int i=1; i<=m-1; i++) arr[n][i]='r';

     arr[1][1]='d'; arr[2][1]='X';

     int p=0,k1=k;
     while (k1) {
          k1/=2; p++;
     }

     for (int i=2; i<=n; i++) {
          for (int j=2; j<=m; j++) {
               if ((i+j-2)<=p) arr[i][j]='X';
          }
     }

     for (int i=p-2; i>=0; i--) {
          if (k&(1ll<<i)) {
               int ind=((p-2)-i)+3;
               arr[ind][1]='X';
          }
     }

     cout<<n<<" "<<m<<endl;
     for (int i=1; i<=n; i++) {
          for (int j=1; j<=m; j++) {
               cout<<arr[i][j];
          }
          cout<<endl;
     }
}
main () {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	T=1; 
	while (T--) test_case();
}

Compilation message

costinland.cpp:1: warning: ignoring '#pragma gcc diagnostic' [-Wunknown-pragmas]
    1 | #pragma gcc diagnostic "-std=c++1z"
      | 
costinland.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main () {
      | ^~~~

Subtask #1
12.0 / 20.0

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

Subtask #2
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Partially Correct! Your size: 61
2 Partially correct 0 ms 452 KB Partially Correct! Your size: 61
3 Incorrect 0 ms 348 KB The output does not fit the requirements
4 Halted 0 ms 0 KB -