結果
問題 | No.883 ぬりえ |
ユーザー |
|
提出日時 | 2019-09-13 21:30:32 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 3,395 bytes |
コンパイル時間 | 2,183 ms |
コンパイル使用メモリ | 194,912 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-04 10:32:44 |
合計ジャッジ時間 | 3,048 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 19 |
ソースコード
#ifndef _GLIBCXX_DEBUG#define _GLIBCXX_DEBUG#endif#include <bits/stdc++.h>#define whlie while#define pb push_back#define eb emplace_back#define fi first#define se second#define rep(i,N) for(int i = 0; i < (N); i++)#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)#define rep1(i,N) for(int i = 1; i <= (N) ; i++)#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)#define each(x,v) for(auto& x : v)#define all(v) (v).begin(),(v).end()#define sz(v) ((int)(v).size())#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)using namespace std; void solve();using ll = long long; using vl = vector<ll>;using vi = vector<int>; using vvi = vector< vector<int> >;constexpr int inf = 1001001001;constexpr ll infLL = (1LL << 61) - 1;struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);}} iosetupnya;template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os;}template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}template<typename T>void die(T x){out(x); exit(0);}#ifdef NyaanDebug#include "NyaanDebug.h"#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)#define trca(v,...) do { cerr << #v << " = "; array_out(v , __VA_ARGS__ );} while(0)#else#define trc(...)#define trca(...)int main(){solve();}#endifusing P = pair<int,int>; using vp = vector<P>;constexpr int MOD = /**/ 1000000007; //*/ 998244353;///////////////////グリッド#ifdef NyaanDebug#define gtrc() g_trace()#else#define gtrc() 1#endifint H,W; vector<string> g;const int dx[]={1,0,-1,0}; const int dy[]={0,1,0,-1};const int dn = 4;//const int dx[]={1,1,1,0,-1,-1,-1,0}; const int dy[]={1,0,-1,-1,-1,0,1,1};const int dn = 8;//using PP = pair<pair<int,int>,pair<int,int>>;inline bool ok(int x,int y){return 0<=x && x<H && 0<=y && y<W ;}void g_trace(){ rep(i,H) cerr << g[i] << endl; }void grid(){ cin>>H>>W; g.resize(H); rep(i,H) cin>>g[i]; }void solve(){ini(N , K);H = (N + K - 1)/ K;whlie(H * H < N) H++;W = H;g.resize(H);rep(i,H) rep(j,W) g[i].pb('.');gtrc();int cnt = 0;rep(i , H) rep(j , W){g[(i + j) % H][j] = '#';cnt++;if(cnt == N) {i = H;break;}}out(H);rep(i,H) out(g[i]);}