Submission #991298
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for(int i=a;i<(int)b;i++) #define rep(i,n) REP(i,0,n) #define all(c) (c).begin(), (c).end() #define zero(a) memset(a, 0, sizeof a) #define minus(a) memset(a, -1, sizeof a) #define watch(a) { cout << #a << " = " << a << endl; } template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); } template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); } typedef long long ll; int const inf = 1<<29; vector<vector<string>> vs; int main() { int H, W; cin >> H >> W; vs.resize(H); rep(i, H) vs[i].resize(W); rep(i, H) rep(j, W) { cin >> vs[i][j]; if(vs[i][j] == "snuke") { cout << char(i + 'A') << j << endl; return 0; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | motxx |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 836 Byte |
Status | WA |
Exec Time | 64 ms |
Memory | 764 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
all | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | WA | 64 ms | 764 KB |
01-02.txt | WA | 3 ms | 256 KB |
01-03.txt | WA | 3 ms | 256 KB |
01-04.txt | WA | 3 ms | 256 KB |
01-05.txt | WA | 3 ms | 256 KB |
01-06.txt | WA | 3 ms | 256 KB |
01-07.txt | WA | 3 ms | 256 KB |
sample-01.txt | WA | 2 ms | 256 KB |
sample-02.txt | WA | 3 ms | 256 KB |