Submission #471491

#	Time	Username	Problem	Language	Result	Execution time	Memory
471491		NhatMinh0208	Costinland (info1cup19_costinland)	C++14	100 / 100	1 ms	256 KiB

costinland

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "in.txt"
#define FILE_OUT "out.txt"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
 
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}
 
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
 
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
ll n,m,i,j,k,t,t1,t2,u,v,a,b,h;
ll dp[61][61];
char mp[61][61];
vector<piii(ll)> vec;
const ll woah=263747951750360;
int main()
{
    // ofile;
	fio;
    cin>>t;
    if (t<=19)
    {
           for (n=1;n<=60;n++) {
        if ((1LL<<(n+1))-2>=t) break;
    }
    for (i=1;i<=n+1;i++) {
        for (j=1;j<=n+1;j++) mp[i][j]='.';
        // cout<<endl;
    }
    for (i=1;i<=n;i++) {
        mp[i][n+1]='d';
        mp[n+1][i]='r';
    }
    mp[n+1][n+1]='.';
    for (i=1;i<n;i++) {
        mp[i][i]='X';
        mp[i][i+1]='d';
        mp[i+1][i]='r';
    }
    mp[n][n]='r';
    for (i=1;i<n;i++) {
        vec.push_back({(1LL<<(i-1)),{i,i+1}});
        vec.push_back({(1LL<<(i-1)),{i+1,i}});
    }
    vec.push_back({(1LL<<(n-1)),{n,n}});
    t-=((1LL<<(n-1)));
    
    if (t) {
        sort(vec.begin(),vec.end(),[](piii(ll) a, piii(ll) b) {
            return (a.p1>b.p1);
        });
        for (auto g : vec) {
            if (t>=g.fi) {
        // cout<<g.fi<<' '<<g.se.fi<<' '<<g.se.se<<endl;
                t-=g.fi;
                mp[g.se.fi][g.se.se]='X';
            }
        }
    }
    cout<<n+1<<' '<<n+1<<endl;
    for (i=1;i<=n+1;i++) {
        for (j=1;j<=n+1;j++) cout<<mp[i][j];
        cout<<endl;
    }
      
    }
  else {
    for (i=1;i<=49;i++) for (j=1;j<=49;j++) {
        mp[i][j]='.';
    }
 
    for (i=1;i<=49;i++) {
        mp[i][49]='d';
        mp[49][i]='r';
    }
    mp[49][49]='.';
    for (i=1;i<=29;i++) for (j=1;j<=i;j++) {
        if (i==j) {
            mp[i+2][j]='d';
        } else if (i==29) {
            mp[i+2][j]='r';
        } else {
            mp[i+2][j]='X';
        }
    }
    for (i=1;i<=47;i++) {
        mp[i][i]='d';
        mp[i][i+1]='d';
        mp[i+1][i]='r';
    }
    mp[48][48]='d';
    for (i=1;i<=16;i++) {
        mp[31+i][28+i]='d';
        mp[31+i][28+i+1]='d';
        mp[31+i+1][28+i]='r';
    }
    mp[48][45]='d';
 
 
    t1=t%woah;
    t2=t/woah;
    if (t1 && !t2) {
        mp[2][1]='r';
    } else if (!t1 && t2) {
        mp[2][1]='d';
    } else {
        mp[2][1]='X';
    }
 
    a=31; b=28;
    u=1;
    for (i=1;i<=16;i++) if (u*2<=t2) {
        u*=2;
        mp[a+i][b+i]='X';
    } else break;
    t2-=u;
    u=1;
    for (i=15;i>=0;i--) {
        if (t2>=(1LL<<(i))) {
            t2-=(1LL<<(i));
            mp[a+i+2][b+i+1]='X';
        }
        u*=2;
    }
 
 
 
    a=0; b=0;
    u=1;
    for (i=1;i<=47;i++) if (u*2<=t1) {
        u*=2;
        mp[a+i][b+i]='X';
    } else break;
    t1-=u;
    // cout<<t1<<endl;
    u=1;
    for (i=46;i>=0;i--) {
        if (t1>=(1LL<<(i))) {
            t1-=(1LL<<(i));
            mp[a+i+1][b+i+2]='X';
        }
        u*=2;
    }
 
    
    cout<<49<<' '<<49<<endl;
    for (i=1;i<=49;i++) {
        for (j=1;j<=49;j++) cout<<mp[i][j];
        cout<<endl;
    }
  }
}
// Normie28;
 
/*
1 1 1 1 1
1 2 3 4 5
1 3 6 10 15
1 4 10 20
1 5 15
 
0 0 0 0 
0 x x x
0 0 0 0 
x x x x
 
1s 2^47
2s 2^16
 
11______________ 
111_____________
d111____________
xd111___________
xxd111__________
xxxd111_________
xxxxd111________
xxxxxd111_______
rrrrrrd111______
______22111_____
______222111____
_______222111___
________222111__
_________222111_
__________222111
___________22_11
*/

Compilation message (stderr)

costinland.cpp:24: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   24 | #pragma comment(linker, "/stack:200000000")
      |

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