QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #759965 | #9548. The Fool | _LSA_ | RE | 1ms | 4020kb | C++14 | 1019b | 2024-11-18 13:39:47 | 2024-11-18 13:40:04 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
ll X = 0 ,r = 1;
char ch = getchar();
while(!isdigit(ch) && ch != '-') ch = getchar();
if(ch == '-') r = -1,ch = getchar();
while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
return X*r;
}
const int N = 110;
int n,m,k,tot;
string s[N*N];
void solve(){
n = read(); m = read(); k = read();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
for(int l=1;l<=k;l++){
char ch; cin >> ch;
s[(i-1)*m+j] += ch;
}
if(s[1] != s[2] && s[2] == s[3]){
cout << "1 1\n";
}else{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++) if(s[(i-1)*m+j] != s[1]){
cout << i << " " << j << "\n";
}
}
}
int main(){
int T = 1;
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3904kb
input:
3 5 3 QWQQWQQWQQWQQWQ QWQQWQQWQQWQQWQ QWQQWQQWQQWQQwQ
output:
3 5
result:
ok single line: '3 5'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
2 2 1 LL }L
output:
2 1
result:
ok single line: '2 1'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3896kb
input:
2 2 10 u+gl<d'a9Bu+gl<d'a9B )M0wM2_Z8!u+gl<d'a9B
output:
2 1
result:
ok single line: '2 1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
2 2 10 ayspaufftvuaaavaaaaa uaaavaaaaauaaavaaaaa
output:
1 1
result:
ok single line: '1 1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3952kb
input:
2 2 10 uaaavaaaaauaaavaaaaa ayspaufftvuaaavaaaaa
output:
2 1
result:
ok single line: '2 1'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3972kb
input:
2 2 10 uaaavaaaaaayspaufftv uaaavaaaaauaaavaaaaa
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
2 2 10 uaaavaaaaauaaavaaaaa uaaavaaaaaayspaufftv
output:
2 2
result:
ok single line: '2 2'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
2 2 10 aaarlaaaghaaaaanisaa aaaaanisaaaaaaanisaa
output:
1 1
result:
ok single line: '1 1'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3964kb
input:
2 2 10 aaaaanisaaaaaaanisaa aaarlaaaghaaaaanisaa
output:
2 1
result:
ok single line: '2 1'
Test #10:
score: 0
Accepted
time: 0ms
memory: 4016kb
input:
2 2 10 aaaaanisaaaaarlaaagh aaaaanisaaaaaaanisaa
output:
1 2
result:
ok single line: '1 2'
Test #11:
score: 0
Accepted
time: 0ms
memory: 4020kb
input:
2 2 10 aaaaanisaaaaaaanisaa aaaaanisaaaaarlaaagh
output:
2 2
result:
ok single line: '2 2'
Test #12:
score: -100
Runtime Error
input:
200 199 1 ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo oooooooooooooooooooooooooooooooooooowooooooooooooooooooooooooooooooooooooooooooooooooooooo...