Submission #5910344


Source Code Expand

import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

H, W = list(map(int, sys.stdin.readline().split()))
S = np.array([sys.stdin.readline().rstrip().split() for _ in range(H)])
[h], [w] = np.where(S == 'snuke')

print(string.ascii_uppercase[w] + str(h + 1))

Submission Info

Submission Time
Task A - Where's Snuke?
User nohtaray
Language Python (3.4.3)
Score 100
Code Size 610 Byte
Status AC
Exec Time 159 ms
Memory 13644 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 11
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 156 ms 13584 KB
01-02.txt AC 159 ms 13640 KB
01-03.txt AC 156 ms 13584 KB
01-04.txt AC 158 ms 13584 KB
01-05.txt AC 155 ms 13560 KB
01-06.txt AC 156 ms 13584 KB
01-07.txt AC 156 ms 13640 KB
sample-01.txt AC 155 ms 13640 KB
sample-02.txt AC 156 ms 13644 KB