Submission #1623321
Source Code Expand
#include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> // get<n>(xxx) #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> // S.insert(M); // if (S.find(key) != S.end()) { } // for (auto it=S.begin(); it != S.end(); it++) { } // auto it = S.lower_bound(M); #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> // atoi(xxx) using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. // insert #if<tab> by my emacs. #if DEBUG == 1 ... #end typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int H, W, d; char c[4] = {'R', 'Y', 'G', 'B'}; int color(int x, int y) { int nx = x+y; int ny = x-y + 500 * d; int ans = 0; if ((nx/d)%2 == 0) { ans += 2; } if ((ny/d)%2 == 0) { ans += 1; } return ans; } int main () { cin >> H >> W >> d; int ans[510][510]; for (auto i = 0; i < H; ++i) { for (auto j = 0; j < W; ++j) { ans[i][j] = color(i, j); } } for (auto i = 0; i < H; ++i) { for (auto j = 0; j < W; ++j) { cout << c[ans[i][j]]; if (j == W-1) { cout << endl; } } } }
Submission Info
Submission Time | |
---|---|
Task | D - Four Coloring |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1574 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 3 ms | 1280 KB |
1_07.txt | AC | 3 ms | 1280 KB |
1_08.txt | AC | 3 ms | 1280 KB |
1_09.txt | AC | 3 ms | 1280 KB |
1_10.txt | AC | 12 ms | 1536 KB |
1_11.txt | AC | 12 ms | 1536 KB |
1_12.txt | AC | 12 ms | 1536 KB |
1_13.txt | AC | 12 ms | 1536 KB |
1_14.txt | AC | 9 ms | 1280 KB |
1_15.txt | AC | 11 ms | 1408 KB |
1_16.txt | AC | 10 ms | 1280 KB |
1_17.txt | AC | 11 ms | 1408 KB |
1_18.txt | AC | 10 ms | 1280 KB |
1_19.txt | AC | 9 ms | 1280 KB |
1_20.txt | AC | 11 ms | 1408 KB |
1_21.txt | AC | 10 ms | 1408 KB |
1_22.txt | AC | 7 ms | 1152 KB |
1_23.txt | AC | 9 ms | 1280 KB |
1_24.txt | AC | 8 ms | 1152 KB |
1_25.txt | AC | 10 ms | 1280 KB |
1_26.txt | AC | 9 ms | 1152 KB |
1_27.txt | AC | 10 ms | 1280 KB |
1_28.txt | AC | 11 ms | 1408 KB |
1_29.txt | AC | 9 ms | 1280 KB |
1_30.txt | AC | 8 ms | 1408 KB |
1_31.txt | AC | 10 ms | 1408 KB |
1_32.txt | AC | 11 ms | 1408 KB |
1_33.txt | AC | 9 ms | 1280 KB |
1_34.txt | AC | 10 ms | 1408 KB |
1_35.txt | AC | 11 ms | 1408 KB |
1_36.txt | AC | 11 ms | 1408 KB |
1_37.txt | AC | 11 ms | 1408 KB |
1_38.txt | AC | 11 ms | 1408 KB |
1_39.txt | AC | 11 ms | 1408 KB |
1_40.txt | AC | 10 ms | 1280 KB |
1_41.txt | AC | 11 ms | 1408 KB |
1_42.txt | AC | 9 ms | 1280 KB |
1_43.txt | AC | 11 ms | 1408 KB |
1_44.txt | AC | 11 ms | 1408 KB |
1_45.txt | AC | 10 ms | 1280 KB |