Submission #1382820

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int H, W, Q;
P id[26];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> H >> W >> Q;
  rep(i, 26) id[i] = P(-1, -1);
  rep(y, H) {
    rep(x, W) {
      char c;
      cin >> c;
      if (c != '*') id[c-'A'] = P(x, y);
    }
  }
  rep(i, Q) {
    char c;
    cin >> c;
    P p = id[c-'A'];
    if (p._1 == -1) cout << "NA\n";
    else cout << p._2+1 << " " << p._1+1 << "\n";
  }
  return 0;
}

Submission Info

Judge Result