Submission #1234790

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234790		Solikha	Costinland (info1cup19_costinland)	C++20	10.93 / 100	1 ms	328 KiB

costinland

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ss second
#define ff first
#define pb push_back 
 
void solve(){
  int k; cin >> k;
  int n = 50;
  vector<vector<char>> v(n, vector<char> (n, '.'));
  vector<vector<int>> cnt(n, vector<int> (n));
  v[0][0] = 'X';
  cnt[0][1] = 1;
  cnt[1][0] = 1;
  for(int i = 0; i < n; i ++){
    for(int j = 0; j < n; j ++){
      if(i < n - 1 && j == n - 1) v[i][j] = 'd';
      if(i == n - 1 && j < n - 1) v[i][j] = 'r';
    }
  }

  int ans = 2;
  for(int i = 0; i < n - 1; i++){
    bool d = false;
    for(int j = 0; j < n - 1; j++){
      if(i == 0 && j == 0) continue;
      if(ans == k) v[i][j] = 'r';
      else{
        if(cnt[i][j] <= k - ans && !d){
          v[i][j] = 'X';
          ans += cnt[i][j];
          cnt[i][j + 1] += cnt[i][j];
          cnt[i + 1][j] += cnt[i][j];
        }else{
          v[i][j] = 'r';
          d = true;
        }
      }
    }
  }

  cout << n << ' ' << n << endl;
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++) cout << v[i][j];
    cout << endl;
  }
}

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t = 1; //cin >> t;
  while(t--){
    solve();
    cout << endl;
  }
  return 0;
}

• Subtask 1: 10.9312 / 20
• Subtask 2: 0 / 80