Submission #18618330

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int H = 50;
constexpr int W = 50;
constexpr int K = 8;
int grid[H][W];
bool used[H][W];
vector<P> ps;

inline void input(){
    int __;
    cin >> __ >> __ >> __;
    for(int r = 0; r < H; ++r){
        for(int c = 0; c < W; ++c){
            char ch;
            cin >> ch;
            grid[r][c] = ch - '0';
        }
    }
}

inline void output(){
    cout << 0 << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    input();
    output();
}

Submission Info

Judge Result