Submission #3567631
Source Code Expand
#include <iostream>
#include <cassert>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int,int> P;
int N = 30,A[31][31],count = 0,sum = 0;
int dx[4] = {-1,0,1,0},dy[4] = {0,-1,0,1},visited[31][31] = {{0}};
vector<P> ans;
void print(){
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
cout << A[i][j] << (j!=N? " ":"\n");
}
}
}
bool in(int x,int y){
return 1<=x && x<=N && 1<=y && y<=N;
}
vector<P> longest(int x,int y,vector<P> v){
v.push_back({x,y});
vector<P> result = v;
if(A[x][y]==1) return result;
for(int k=0;k<4;k++){
int nx = x+dx[k],ny = y+dy[k];
if(!in(nx,ny)) continue;
if(A[x][y]-1==A[nx][ny]){
result = longest(nx,ny,v);
return result;
}
}
return result;
}
bool istop(int x, int y){
for(int k=0;k<4;k++){
int nx = x+dx[k],ny = y+dy[k];
if(!in(nx,ny)) continue;
if(A[nx][ny]>A[x][y]) return false;
}
return true;
}
P where_is_top(){
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
if(istop(i,j)){
return {i,j};
}
}
}
}
int main(){
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
cin >> A[i][j];
sum += A[i][j];
}
}
while(count<sum){
P p = where_is_top();
vector<P> v;
vector<P> res = longest(p.first,p.second,v);
for(int i=0;i<res.size();i++){
ans.push_back({res[i].first,res[i].second});
A[res[i].first][res[i].second]--;
count++;
}
}
for(int i=0;i<ans.size();i++){
cout << ans[i].first << " " << ans[i].second << endl;
}
}
Submission Info
Submission Time |
|
Task |
A - 高橋君の山崩しゲーム |
User |
idsigma |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1525 Byte |
Status |
WA |
Exec Time |
133 ms |
Memory |
1016 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 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 100000 |
0 / 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 |
WA |
124 ms |
1016 KB |
subtask_01_02.txt |
WA |
130 ms |
1016 KB |
subtask_01_03.txt |
WA |
124 ms |
1016 KB |
subtask_01_04.txt |
WA |
133 ms |
1016 KB |
subtask_01_05.txt |
WA |
131 ms |
1016 KB |
subtask_01_06.txt |
WA |
128 ms |
1016 KB |
subtask_01_07.txt |
WA |
126 ms |
1016 KB |
subtask_01_08.txt |
WA |
128 ms |
1016 KB |
subtask_01_09.txt |
WA |
131 ms |
1016 KB |
subtask_01_10.txt |
WA |
127 ms |
1016 KB |