Submission #1354345

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

char board[1010][1010];
pii pos[30];

signed main() {
    int N, M, Q; cin >> N >> M >> Q;
    pii undef = pii(-1, -1);
    rep(i,0,30) pos[i] = undef;
    rep(i,0,N) rep(j,0,M) {
        cin >> board[i][j];
        if('A' <= board[i][j] && board[i][j] <= 'Z') {
            pos[ board[i][j] - 'A' ] = pii(i+1, j+1);
        }
    }
    rep(i,0,Q) {
        char c; cin >> c;
        pii res = pos[ c - 'A' ];
        if(res == undef) cout << "NA" << endl;
        else printf("%lld %lld\n", res.first, res.second);
    }
    return 0;
}

Submission Info

Judge Result