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
Submission Time |
|
Task |
C - 案内所 |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1578 Byte |
Status |
AC |
Exec Time |
59 ms |
Memory |
1280 KB |
Judge Result
Set Name |
small |
large |
Score / Max Score |
20 / 20 |
80 / 80 |
Status |
|
|
Set Name |
Test Cases |
small |
basic/basic_case00, basic/basic_case01, basic/basic_case02, basic/basic_case03, basic/basic_case04, basic/sample00 |
large |
large/large_case00, large/large_case01, large/large_case02, large/large_case03, large/large_case04 |
Case Name |
Status |
Exec Time |
Memory |
basic/basic_case00 |
AC |
1 ms |
256 KB |
basic/basic_case01 |
AC |
1 ms |
256 KB |
basic/basic_case02 |
AC |
1 ms |
256 KB |
basic/basic_case03 |
AC |
1 ms |
256 KB |
basic/basic_case04 |
AC |
1 ms |
256 KB |
basic/sample00 |
AC |
1 ms |
256 KB |
large/large_case00 |
AC |
54 ms |
1280 KB |
large/large_case01 |
AC |
57 ms |
1152 KB |
large/large_case02 |
AC |
57 ms |
1152 KB |
large/large_case03 |
AC |
59 ms |
1280 KB |
large/large_case04 |
AC |
54 ms |
1280 KB |