#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 "cseq.inp"
#define FILE_OUT "cseq.out"
#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,u,v,a,b,h;
ll dp[50][50];
char mp[50][50];
vector<piii(ll)> vec;
int main()
{
fio;
cin>>t;
if (t<=19) {
n=2;
} else n=24;
for (i=1;i<=2*n+1;i++) for (j=1;j<=2*n+1;j++) {
mp[i][j]='.';
}
for (i=1;i<=2*n;i++) {
mp[i][2*n+1]='d';
mp[2*n+1][i]='r';
mp[2*n+1][2*n+1]='.';
}
for (i=2;i<=2*n;i+=2) for (j=2;j<=2*n;j++) {
mp[i][j]='X';
}
for (i=1;i<2*n;i++) {
dp[2*n][2*n+1-i]=i;
vec.push_back({dp[2*n][2*n+1-i],{2*n,2*n+1-i}});
}
for (i=2*n-2;i>=2;i-=2) for (j=2*n;j>=2;j--) {
dp[i][j]=dp[i+2][j];
if (j<2*n) dp[i][j]+=dp[i][j+1];
vec.push_back({dp[i][j],{i,j}});
}
vec.push_back({1,{2*n,1}});
for (auto g: vec) {
// cout<<g.fi<<' '<<g.se.fi<<' '<<g.se.se<<endl;
}
// cout<<t<<endl;
for (i=1;i<2*n;i+=2) {
if (!t) break;
t--;
mp[i][1]='r';
if (i>1) mp[i-2][1]='X';
}
// cout<<t<<endl;
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-1][g.se.se]='X';
}
}
}
cout<<2*n+1<<' '<<2*n+1<<endl;
for (i=1;i<=2*n+1;i++) {
for (j=1;j<=2*n+1;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
*/
Compilation message
costinland.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
23 | #pragma comment(linker, "/stack:200000000")
|
costinland.cpp: In function 'int main()':
costinland.cpp:132:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
132 | for (auto g: vec) {
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
The matrix does not generate the required number of Costins |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
332 KB |
The matrix does not generate the required number of Costins |
| 2 |
Halted |
0 ms |
0 KB |
- |
