結果
問題 | No.331 CodeRunnerでやれ |
ユーザー | E31415926 |
提出日時 | 2016-05-28 18:04:03 |
言語 | C++11 (gcc 11.4.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,247 bytes |
コンパイル時間 | 584 ms |
コンパイル使用メモリ | 57,088 KB |
実行使用メモリ | 98,868 KB |
平均クエリ数 | 9.18 |
最終ジャッジ日時 | 2024-07-16 23:51:38 |
合計ジャッジ時間 | 8,922 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 163 ms
25,460 KB |
testcase_01 | AC | 167 ms
24,592 KB |
testcase_02 | AC | 189 ms
24,848 KB |
testcase_03 | AC | 194 ms
25,232 KB |
testcase_04 | TLE | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
ソースコード
#include<iostream> using namespace std; #define UNKNOWN 0 #define ISEMPTY 1 #define ISWALL 2 #define UNPASSED 3 #define UP 0 #define RIGHT 1 #define DOWN 2 #define LEFT 3 int dirtbl[4][2] = { {0,-1},{1,0},{0,1},{-1,0} }; int main() { //初期位置を(19,19)上向きとする int map[39][39]{ {0} }, x = 19, y = 19, dx = 0, dy = -1, n, i, xtmp, ytmp, direction = UP, dirtmp; map[19][19] = ISEMPTY; while (1) { cin >> n; if (cin.fail()) { return 0; } if (n == 20151224) { cout << "F" << endl << flush; x += dx; y += dy; continue; } xtmp = x + dx; ytmp = y + dy; for (i = 0; i < n; ++i) { if (map[xtmp][ytmp] == UNKNOWN) { map[xtmp][ytmp] = UNPASSED; } xtmp += dx; ytmp += dy; } map[x + (n + 1) * dx][y + (n + 1) * dy] = ISWALL; //右? dirtmp = (direction + 1) % 4; xtmp = dirtbl[dirtmp][0]; ytmp = dirtbl[dirtmp][1]; if (map[x + xtmp][y + ytmp] == UNKNOWN) { cout << "R" << endl << flush; direction = dirtmp; dx = xtmp; dy = ytmp; continue; } //左? dirtmp = (direction + 3) % 4; xtmp = dirtbl[dirtmp][0]; ytmp = dirtbl[dirtmp][1]; if (map[x + xtmp][y + ytmp] == UNKNOWN) { cout << "L" << endl << flush; direction = dirtmp; dx = xtmp; dy = ytmp; continue; } //逆? dirtmp = (direction + 2) % 4; xtmp = dirtbl[dirtmp][0]; ytmp = dirtbl[dirtmp][1]; if (map[x + xtmp][y + ytmp] == UNKNOWN) { cout << "R" <<endl << flush; direction = (direction + 1) % 4; dx = dirtbl[direction][0]; dy = dirtbl[direction][1]; continue; } //前? if (map[x + dx][y + dy] == UNPASSED) { cout << "F" << endl << flush; x += dx; y += dy; map[x][y] = ISEMPTY; continue; } //壁? if (map[x + dx][y + dy] == ISWALL) { dirtmp = (direction + 3) % 4; xtmp = dirtbl[dirtmp][0]; ytmp = dirtbl[dirtmp][1]; if (map[x + xtmp][y + ytmp] == UNPASSED) { cout << "L" << endl << flush; direction = dirtmp; dx = xtmp; dy = ytmp; continue; } else { cout << "R" << endl << flush; direction = (direction + 1) % 4; dx = dirtbl[direction][0]; dy = dirtbl[direction][1]; continue; } } //それ以外 cout << "F" << endl << flush; x += dx; y += dy; map[x][y] = ISEMPTY; } return 0; }