QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#777228 | #9548. The Fool | tizzytyt | AC ✓ | 2ms | 4192kb | C++20 | 2.1kb | 2024-11-23 23:54:15 | 2024-11-23 23:54:23 |
Judging History
answer
#define _CRT_SECURE_NO_WARNINGS 1
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
typedef long long i64;
typedef long double ld;
#define endl "\n"
#define all(a) a.begin(), a.end()
#define int i64
typedef std::pair<int, int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
long long fast_power(i64 a, i64 b, i64 v = mod) {
i64 sum = 1;
a = a % v;
while (b) {
if (b & 1) {
sum = sum * a % v;
}
a = (a * a) % v;
b >>= 1;
}
return sum;
}
int lowbit(int x) {
return x & -x;
}
bool is_prime(int n){
if(n < 2) return false;
for(int i = 2;i <= n / i;i ++){
if(n % i == 0){
return false;
}
}
return true;
}
int inv(int x, int m = mod) {
return fast_power(x, m - 2, m);
}
void solve(){
int n, m, k;
std::cin >> n >> m >> k;
std::string s[n];
for(int i = 0; i < n; i++) {
std::cin >> s[i];
}
int flag = 0;
std::map<std::string, int> mp;
for(int i = 0; i < n; i++) {
std::string tmp;
for(int j = 0; j < m * k; j++) {
tmp += s[i][j];
if(tmp.size() == k) {
mp[tmp] ++;
tmp.clear();
}
}
}
std::string tmp;
for(auto [x, y] : mp) {
if(y == 1) {
tmp = x;
}
}
// std::cout << tmp;
for(int i = 0; i < n; i++) {
std::string tmp2;
for(int j = 0; j < m * k; j++) {
tmp2 += s[i][j];
if(tmp2.size() == k) {
if(tmp2 == tmp) {
std::cout << i + 1 << " " << (j + 1) / k;
}
tmp2.clear();
}
}
}
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("D:/vsc/c/.cph/in.txt", "r", stdin);
// freopen("D:/vsc/c/.cph/out.txt", "w", stdout);
#else
std::cin.tie(0);
std::cout.tie(0);
std::ios::sync_with_stdio(false);
#endif
int t = 1;
// std::cin >> t;
while(t--) {
solve();
}
}
/*
QWQ QWQ QWQ QWQ QWQ
QWQ QWQ QWQ QWQ QWQ
QWQ QWQ QWQ QWQ QwQ
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3516kb
input:
3 5 3 QWQQWQQWQQWQQWQ QWQQWQQWQQWQQWQ QWQQWQQWQQWQQwQ
output:
3 5
result:
ok single line: '3 5'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
2 2 1 LL }L
output:
2 1
result:
ok single line: '2 1'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3548kb
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: 3552kb
input:
2 2 10 ayspaufftvuaaavaaaaa uaaavaaaaauaaavaaaaa
output:
1 1
result:
ok single line: '1 1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3500kb
input:
2 2 10 uaaavaaaaauaaavaaaaa ayspaufftvuaaavaaaaa
output:
2 1
result:
ok single line: '2 1'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
2 2 10 uaaavaaaaaayspaufftv uaaavaaaaauaaavaaaaa
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
2 2 10 uaaavaaaaauaaavaaaaa uaaavaaaaaayspaufftv
output:
2 2
result:
ok single line: '2 2'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 2 10 aaarlaaaghaaaaanisaa aaaaanisaaaaaaanisaa
output:
1 1
result:
ok single line: '1 1'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
2 2 10 aaaaanisaaaaaaanisaa aaarlaaaghaaaaanisaa
output:
2 1
result:
ok single line: '2 1'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 2 10 aaaaanisaaaaarlaaagh aaaaanisaaaaaaanisaa
output:
1 2
result:
ok single line: '1 2'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
2 2 10 aaaaanisaaaaaaanisaa aaaaanisaaaaarlaaagh
output:
2 2
result:
ok single line: '2 2'
Test #12:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
200 199 1 ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo oooooooooooooooooooooooooooooooooooowooooooooooooooooooooooooooooooooooooooooooooooooooooo...
output:
2 37
result:
ok single line: '2 37'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3700kb
input:
199 200 2 1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p...
output:
112 145
result:
ok single line: '112 145'
Test #14:
score: 0
Accepted
time: 1ms
memory: 3740kb
input:
199 199 3 "-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-...
output:
46 95
result:
ok single line: '46 95'
Test #15:
score: 0
Accepted
time: 2ms
memory: 3676kb
input:
200 200 4 ^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^p...
output:
113 72
result:
ok single line: '113 72'
Test #16:
score: 0
Accepted
time: 2ms
memory: 3828kb
input:
200 200 5 kk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gA...
output:
66 8
result:
ok single line: '66 8'
Test #17:
score: 0
Accepted
time: 2ms
memory: 3824kb
input:
200 200 6 5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q...
output:
84 106
result:
ok single line: '84 106'
Test #18:
score: 0
Accepted
time: 2ms
memory: 3804kb
input:
200 200 7 N3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&...
output:
80 103
result:
ok single line: '80 103'
Test #19:
score: 0
Accepted
time: 2ms
memory: 4192kb
input:
200 200 8 82`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482...
output:
5 68
result:
ok single line: '5 68'
Test #20:
score: 0
Accepted
time: 2ms
memory: 4016kb
input:
200 200 9 c[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[...
output:
8 169
result:
ok single line: '8 169'
Test #21:
score: 0
Accepted
time: 2ms
memory: 3988kb
input:
200 200 10 ,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@...
output:
58 91
result:
ok single line: '58 91'
Extra Test:
score: 0
Extra Test Passed