Submission #8244514
Source Code Expand
#include <iostream> #include <array> using namespace std; typedef long long ll; #define REP(i,n) for (ll i = 0; i < (n); ++i) const int SIZE = 30; array<array<int, SIZE>, SIZE> a; int main(){ REP(i, SIZE){ REP(j, SIZE){ cin >> a[i][j]; } } while(1){ int sx = 0, sy = 0; REP(i, SIZE){ REP(j, SIZE){ if(a[i][j] > a[sx][sy]){ sx = i; sy = j; } } } if(a[sx][sy] == 0){ break; } cout << sx + 1 << ' ' << sy + 1 << endl; a[sx][sy]--; const array<int, 4> dx = {0, -1, 0, 1}; const array<int, 4> dy = {-1, 0, 1, 0}; while(a[sx][sy] > 0){ bool moved = false; REP(k, dx.size()){ if(sx + dx[k] < 0 || sx + dx[k] >= SIZE || sy + dy[k] < 0 || sy + dy[k] >= SIZE){ continue; }else if(a[sx + dx[k]][sy + dy[k]] == a[sx][sy]){ sx += dx[k]; sy += dy[k]; a[sx][sy]--; cout << sx + 1 << ' ' << sy + 1 << endl; moved = true; break; } } if(!moved){ break; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 高橋君の山崩しゲーム |
User | sensaur |
Language | C++14 (Clang 3.8.0) |
Score | 812385 |
Code Size | 1440 Byte |
Status | AC |
Exec Time | 183 ms |
Memory | 1144 KB |
Judge Result
Set Name | test_01 | test_02 | test_03 | test_04 | test_05 | test_06 | test_07 | test_08 | test_09 | test_10 | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 81429 / 100000 | 81095 / 100000 | 81297 / 100000 | 80535 / 100000 | 81184 / 100000 | 81132 / 100000 | 81511 / 100000 | 81665 / 100000 | 81374 / 100000 | 81163 / 100000 | ||||||||||||||||||||
Status |
|
|
|
|
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
test_01 | subtask_01_01.txt |
test_02 | subtask_01_02.txt |
test_03 | subtask_01_03.txt |
test_04 | subtask_01_04.txt |
test_05 | subtask_01_05.txt |
test_06 | subtask_01_06.txt |
test_07 | subtask_01_07.txt |
test_08 | subtask_01_08.txt |
test_09 | subtask_01_09.txt |
test_10 | subtask_01_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_01.txt | AC | 178 ms | 1144 KB |
subtask_01_02.txt | AC | 178 ms | 512 KB |
subtask_01_03.txt | AC | 177 ms | 512 KB |
subtask_01_04.txt | AC | 183 ms | 512 KB |
subtask_01_05.txt | AC | 173 ms | 512 KB |
subtask_01_06.txt | AC | 179 ms | 512 KB |
subtask_01_07.txt | AC | 177 ms | 512 KB |
subtask_01_08.txt | AC | 177 ms | 512 KB |
subtask_01_09.txt | AC | 175 ms | 512 KB |
subtask_01_10.txt | AC | 178 ms | 512 KB |