QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #752839 | #9548. The Fool | ucup-team3646# | WA | 14ms | 10640kb | Python3 | 270b | 2024-11-16 10:05:30 | 2024-11-16 10:05:31 |
Judging History
answer
from collections import defaultdict
h,w,k=map(int,input().split())
s=[input() for i in range(h)]
d=defaultdict(list)
for x in range(h):
for y in range(w):
t=s[x][y*k:y*(k+1)]
d[t].append((x+1,y+1))
for t in d:
if len(d[t])==1:
print(*d[t][0])
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 10572kb
input:
3 5 3 QWQQWQQWQQWQQWQ QWQQWQQWQQWQQWQ QWQQWQQWQQWQQwQ
output:
3 5
result:
ok single line: '3 5'
Test #2:
score: -100
Wrong Answer
time: 14ms
memory: 10640kb
input:
2 2 1 LL }L
output:
result:
wrong answer 1st lines differ - expected: '2 1', found: ''