Submission #9537454
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cstring> #include <cmath> #include <limits> #include <stack> #include <queue> #include <map> #include <set> #include <functional> #include <iomanip> using namespace std; #ifdef LOCAL #define eprintf(...) fprintf(stderr, __VA_ARGS__) #else #define eprintf(...) 42 #endif using ll = long long; using vll = std::vector<ll>; using vvll = std::vector<vll>; using vvvll = std::vector<vvll>; #define reps(i, S, E) for (ll i = (S); i <= (E); i++) #define rep(i, N) reps(i, 0, N-1) #define deps(i, E, S) for (ll i = (E); i >= (S); i--) #define dep(i, N) deps(i, N-1, 0) const ll INF = 1LL << 60; const int INF_INT = 1 << 30; template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; } template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; } struct mll { static ll MOD; ll val; mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; } mll operator - () const { return -val; } mll operator + (const mll &b) const { return val + b.val; } mll operator - (const mll &b) const { return val - b.val; } mll operator * (const mll &b) const { return val * b.val; } mll operator / (const mll &b) const { return mll(*this) /= b; } mll operator + (ll b) const { return *this + mll(b); } mll operator - (ll b) const { return *this - mll(b); } mll operator * (ll b) const { return *this * mll(b); } friend mll operator + (ll a, const mll &b) { return b + a; } friend mll operator - (ll a, const mll &b) { return -b + a; } friend mll operator * (ll a, const mll &b) { return b * a; } mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; } mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; } mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; } mll &operator /= (const mll &b) { ll c = b.val, d = MOD, u = 1, v = 0; while (d) { ll t = c / d; c -= t * d; swap(c, d); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } mll &operator += (ll b) { return *this += mll(b); } mll &operator -= (ll b) { return *this -= mll(b); } mll &operator *= (ll b) { return *this *= mll(b); } mll &operator /= (ll b) { return *this /= mll(b); } bool operator == (const mll &b) { return val == b.val; } bool operator != (const mll &b) { return val != b.val; } bool operator == (ll b) { return *this == mll(b); } bool operator != (ll b) { return *this != mll(b); } friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; } friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; } friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; } friend istream &operator >> (istream &is, mll &a) { return is >> a.val; } static mll Combination(ll a, ll b) { chmin(b, a - b); if (b < 0) return mll(0); mll c = 1; rep(i, b) c *= a - i; rep(i, b) c /= i + 1; return c; } }; using vmll = std::vector<mll>; using vvmll = std::vector<vmll>; using vvvmll = std::vector<vvmll>; using vvvvmll = std::vector<vvvmll>; struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(std::numeric_limits<double>::max_digits10); } } fast; //cin,cout高速化のおまじない+桁数指定 ll mll::MOD = (ll)(1e9 + 7);// 998244353ll; ll W = 100; int main() { ll A; cin >> A; ll B; cin >> B; vvll result(W, vll(W, -1)); rep(i, W) { rep(j, W) { result[i][j] = i < W / 2 ? 1 : 0; } } A--; B--; for (ll i = W / 2 + 1; i < W; i += 2) { if (A == 0) { break; } for (ll j = 0; j < W; j += 2) { result[i][j] = 1; A--; if (A == 0) { break; } } } for (ll i = 0; i < W / 2; i += 2) { if (B == 0) { break; } for (ll j = 0; j < W; j += 2) { result[i][j] = 0; B--; if (B == 0) { break; } } } cout << W << " " << W << endl; rep(i, W) { rep(j, W) { if (result[i][j] == 0) { cout << "#"; } else { cout << "."; } } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Grid Components |
User | shu_crim |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 4281 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 2 ms | 384 KB |
02.txt | AC | 2 ms | 384 KB |
03.txt | AC | 2 ms | 384 KB |
04.txt | AC | 2 ms | 384 KB |
05.txt | AC | 2 ms | 384 KB |
06.txt | AC | 2 ms | 384 KB |
07.txt | AC | 2 ms | 384 KB |
08.txt | AC | 2 ms | 384 KB |
09.txt | AC | 2 ms | 384 KB |
10.txt | AC | 2 ms | 384 KB |
11.txt | AC | 2 ms | 384 KB |
12.txt | AC | 2 ms | 384 KB |
13.txt | AC | 2 ms | 384 KB |
14.txt | AC | 2 ms | 384 KB |
15.txt | AC | 2 ms | 384 KB |
16.txt | AC | 2 ms | 384 KB |
17.txt | AC | 2 ms | 384 KB |
18.txt | AC | 2 ms | 384 KB |
19.txt | AC | 2 ms | 384 KB |
20.txt | AC | 2 ms | 384 KB |
21.txt | AC | 2 ms | 384 KB |
22.txt | AC | 2 ms | 384 KB |
23.txt | AC | 2 ms | 384 KB |
24.txt | AC | 2 ms | 384 KB |
25.txt | AC | 2 ms | 384 KB |
26.txt | AC | 2 ms | 384 KB |
27.txt | AC | 2 ms | 384 KB |
28.txt | AC | 2 ms | 384 KB |
29.txt | AC | 2 ms | 384 KB |
30.txt | AC | 2 ms | 384 KB |
31.txt | AC | 2 ms | 384 KB |
32.txt | AC | 2 ms | 384 KB |
33.txt | AC | 2 ms | 384 KB |
34.txt | AC | 2 ms | 384 KB |
35.txt | AC | 2 ms | 384 KB |
36.txt | AC | 2 ms | 384 KB |
37.txt | AC | 2 ms | 384 KB |
38.txt | AC | 2 ms | 384 KB |
39.txt | AC | 2 ms | 384 KB |
40.txt | AC | 2 ms | 384 KB |
sample-01.txt | AC | 2 ms | 384 KB |
sample-02.txt | AC | 2 ms | 384 KB |
sample-03.txt | AC | 2 ms | 384 KB |
sample-04.txt | AC | 2 ms | 384 KB |