Submission #1140726

---

Source Code Expand

#include <cstdio>
#include <vector>

using namespace std;

int H, W, K;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int board[52][52];
bool used[52][52];

void solve() {
    int i, j, k, l;
    vector <pair<int, int> > ans;
    
    for (i = 1; i <= H; i++) {
        for (j = 1; j <= W; j++) {
            if (used[i][j] == true || board[i][j] == 0) continue;
            
            int best_score = 0, best_move;
            
            for (k = 0; k < (1 << ((K - 1) * 2)); k++) {
                int x = i, y = j, score = board[i][j];
                
                used[i][j] = true;
                
                for (l = 0; l < K - 1; l++) {
                    int move = (k >> (l * 2)) & 3;
                    
                    x += dx[move];
                    y += dy[move];
                    
                    if (used[x][y] == true || board[x][y] == 0) break;
                    
                    used[x][y] = true;
                    score *= board[x][y];
                }
                
                if (l == K - 1 && score > best_score) {
                    best_score = score;
                    best_move = k;
                }
                
                x = i, y = j;
                
                used[i][j] = false;
                
                for (l = 0; l < K - 1; l++) {
                    int move = (k >> (l * 2)) & 3;
                    
                    x += dx[move];
                    y += dy[move];
                    
                    if (used[x][y] == false || board[x][y] == 0) break;
                    
                    used[x][y] = false;
                }
            }
            
            if (best_score > 0) {
                int x = i, y = j;
                
                used[i][j] = true;
                ans.push_back(make_pair(i, j));
                
                for (l = 0; l < K - 1; l++) {
                    int move = (best_move >> (l * 2)) & 3;
                    
                    x += dx[move];
                    y += dy[move];
                    
                    used[x][y] = true;
                    ans.push_back(make_pair(x, y));
                }
            }
        }
    }
    
    printf("%d\n", ans.size() / K);
    for (i = 0; i < ans.size(); i++) printf("%d %d\n", ans[i].first, ans[i].second);
}

int main() {
    int i, j;
    
    scanf("%d %d %d", &H, &W, &K);
    
    for (i = 0; i < H; i++) {
        for (j = 0; j < W; j++) {
            scanf("%1d", &board[i + 1][j + 1]);
        }
    }
    
    solve();
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:79:34: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘std::vector<std::pair<int, int> >::size_type {aka long unsigned int}’ [-Wformat=]
     printf("%d\n", ans.size() / K);
                                  ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:86:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &H, &W, &K);
                                  ^
./Main.cpp:90:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%1d", &board[i + 1][j + 1]);
                                               ^

Judge Result