oj.uz

Submission #471405

# Submission time Handle Problem Language Result Execution time Memory
471405 2021-09-09T03:31:40 Z NhatMinh0208 Costinland (info1cup19_costinland) C++14
72.3068 / 100
 1 ms 332 KB 
#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,u,v,a,b,h;
ll dp[61][61];
char mp[61][61];
vector<piii(ll)> vec;
int main()
{
    //ofile;
	fio;
    cin>>t;
    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;
    }
}
// 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


11_22___
111222__
_111222_
__111222
___11122
____111_
_____111
______11
*/

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
52.306815544 / 80.0

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