Submission #3574382
Source Code Expand
/** * File : A.cpp * Author : Kazune Takahashi * Created : 2018-11-10 15:20:13 * Powered by Visual Studio Code */ #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> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <functional> #include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725)); #include <chrono> // std::chrono::system_clock::time_point start_time, end_time; // start = std::chrono::system_clock::now(); // double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count(); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. 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 N, M, L; string S[500]; string T[29]; void input() { cin >> N >> M >> L; for (auto i = 0; i < N; i++) { cin >> S[i]; } } void make_wall() { string wall = ""; for (auto i = 0; i < M; i++) { wall += "#"; } for (auto i = 0; i < M; i++) { T[i] = wall; } T[14][14] = '.'; } void flush() { for (auto i = 0; i < M; i++) { cout << T[i] << endl; } } void solve(int k) { assert(1 <= k && k <= 13); for (auto i = 1; i <= k; i++) { for (auto t = 0; t < 4; t++) { int x = M / 2 + dx[t] * i; int y = M / 2 + dy[t] * i; T[x][y] = '.'; } } } int main() { input(); make_wall(); solve(7); flush(); }
Submission Info
Submission Time | |
---|---|
Task | A - ばらばらロボット |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1917 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 5000 | 0 / 145000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt |
All | subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt, subtask_01_19.txt, subtask_01_20.txt, subtask_01_21.txt, subtask_01_22.txt, subtask_01_23.txt, subtask_01_24.txt, subtask_01_25.txt, subtask_01_26.txt, subtask_01_27.txt, subtask_01_28.txt, subtask_01_29.txt, subtask_01_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 6 ms | 512 KB |
subtask_01_02.txt | AC | 6 ms | 512 KB |
subtask_01_03.txt | AC | 6 ms | 512 KB |
subtask_01_04.txt | AC | 6 ms | 512 KB |
subtask_01_05.txt | AC | 6 ms | 512 KB |
subtask_01_06.txt | AC | 6 ms | 512 KB |
subtask_01_07.txt | AC | 6 ms | 512 KB |
subtask_01_08.txt | AC | 6 ms | 512 KB |
subtask_01_09.txt | AC | 6 ms | 512 KB |
subtask_01_10.txt | AC | 6 ms | 512 KB |
subtask_01_11.txt | AC | 6 ms | 512 KB |
subtask_01_12.txt | AC | 6 ms | 512 KB |
subtask_01_13.txt | AC | 6 ms | 512 KB |
subtask_01_14.txt | AC | 6 ms | 512 KB |
subtask_01_15.txt | AC | 6 ms | 512 KB |
subtask_01_16.txt | AC | 6 ms | 512 KB |
subtask_01_17.txt | AC | 6 ms | 512 KB |
subtask_01_18.txt | AC | 6 ms | 512 KB |
subtask_01_19.txt | AC | 6 ms | 512 KB |
subtask_01_20.txt | AC | 6 ms | 512 KB |
subtask_01_21.txt | AC | 6 ms | 512 KB |
subtask_01_22.txt | AC | 6 ms | 512 KB |
subtask_01_23.txt | AC | 6 ms | 512 KB |
subtask_01_24.txt | AC | 6 ms | 512 KB |
subtask_01_25.txt | AC | 6 ms | 512 KB |
subtask_01_26.txt | AC | 6 ms | 512 KB |
subtask_01_27.txt | AC | 6 ms | 512 KB |
subtask_01_28.txt | AC | 6 ms | 512 KB |
subtask_01_29.txt | AC | 6 ms | 512 KB |
subtask_01_30.txt | AC | 6 ms | 512 KB |