QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#790571 | #9548. The Fool | ucup-team5217# | WA | 0ms | 3616kb | C++23 | 513b | 2024-11-28 13:37:19 | 2024-11-28 13:37:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n,m,k;
cin>>n>>m>>k;
pair<int,int> pz;int num=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
for(int j=0;j<m*k;j+=k){
if(s.substr(j,k)!=s.substr(0,k)) {num++;pz={i+1,j/k+1};}
}
}
if(num>=2) cout<<"1 1\n";
else cout<<pz.first<<' '<<pz.second<<'\n';
}
int main(){
ios::sync_with_stdio(0),cin.tie(0);
int _ =1;
// cin>>_;
while(_--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
3 5 3 QWQQWQQWQQWQQWQ QWQQWQQWQQWQQWQ QWQQWQQWQQWQQwQ
output:
3 5
result:
ok single line: '3 5'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3616kb
input:
2 2 1 LL }L
output:
2 2
result:
wrong answer 1st lines differ - expected: '2 1', found: '2 2'