Contest Duration: - (local time) (110 minutes) Back to Home

Submission #7636382

Source Code Expand

Copy
```#include <bits/stdc++.h>
#include <vector>
#include <cmath>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define REPR2(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a) sort(ALL(a), greater<int>())
#define REVERSE(a) reverse(ALL(a))
#define bit_search(bit, n) REP(bit, 1<<(n))
#define bit_check(bit, i) (bit>>(i)) & 1
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) lower_bound(ALL(a), (x)) - a.begin()
#define bisect_right(a, x) upper_bound(ALL(a), (x)) - a.begin()
#define INPUT(a) REP(i, a.size()) cin >> a[i];
#define INPUTP(a) REP(i, a.size()) cin >> a[i].first >> a[i].second;
#define ENDL cout << endl;
using namespace std;
using ll = long long;
using ld = long double;
using PII = pair<int, int>;
using VPII = vector<PII>;
using VI = vector<int>;
using VVI = vector<VI>;
using Vll = vector<ll>;
using VVll = vector<Vll>;
using VC = vector<char>;
using VS = vector<string>;
using VB = vector<bool>;
const int INF = 1e9;
const ll MOD = 1e9 + 7;

int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, A, B;
cin >> H >> W >> A >> B;
VVI ans(H, VI(W));
REP(i, H)
{
REP(j, W)
{
if (i < B && j < A) cout << 1;
else if (i >= B && j < A) cout << 0;
else if (i < B && j >= A) cout << 0;
else if (i >= B && j >= A) cout << 1;
}
ENDL
}
return 0;
}```

#### Submission Info

Submission Time 2019-09-21 21:16:27+0900 A - 01 Matrix Octopus C++14 (GCC 5.4.1) 300 1770 Byte AC 44 ms 5248 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
 AC × 2
 AC × 14
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 42 ms 4864 KB
01-07.txt AC 3 ms 256 KB
01-08.txt AC 27 ms 3072 KB
01-09.txt AC 44 ms 5248 KB
01-10.txt AC 44 ms 5248 KB
01-11.txt AC 44 ms 5248 KB
01-12.txt AC 44 ms 5248 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB