// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
long long rand_range(long long rmin, long long rmax) {
uniform_int_distribution<long long> rdist(rmin, rmax);
return rdist(kami_gen);
}
long double rand_real(long double rmin, long double rmax) {
uniform_real_distribution<long double> rdist(rmin, rmax);
return rdist(kami_gen);
}
void file_io(string fi, string fo) {
if (fi != "" && (!kami_loc || fi == kami_fi)) {
freopen(fi.c_str(), "r", stdin);
}
if (fo != "" && (!kami_loc || fo == kami_fo)) {
freopen(fo.c_str(), "w", stdout);
}
}
void set_up() {
if (kami_loc) {
file_io(kami_fi, kami_fo);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void just_do_it();
void just_exec_it() {
if (kami_loc) {
auto pstart = chrono::steady_clock::now();
just_do_it();
auto pend = chrono::steady_clock::now();
long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
string bar(50, '=');
cout << '\n' << bar << '\n';
cout << "Time: " << ptime << " ms" << '\n';
}
else {
just_do_it();
}
}
int main() {
set_up();
just_exec_it();
return 0;
}
// END BOILERPLATE CODE
// BEGIN MAIN CODE
const long long mod1 = 998244353;
const long long mod2 = 1e9 + 7;
const long long base = 31;
const int ms = 5e2 + 20;
const int st = 30;
const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int a[ms][ms];
pair<long long, long long> pw[st];
pair<long long, long long> h[ms][ms][st];
void just_do_it() {
int n, m, L;
cin >> n >> m >> L;
pw[0] = {base, base};
for (int i = 1; i < st; i++) {
pw[i].first = pw[i - 1].first * pw[i - 1].first % mod1;
pw[i].second = pw[i - 1].second * pw[i - 1].second % mod2;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c;
cin >> c;
a[i][j] = c - 'a';
for (int d = 0; d < 8; d++) {
h[i][j][0] = {a[i][j] + 1, a[i][j] + 1};
}
}
}
map<pair<long long, long long>, int> cnt;
for (int d = 0; d < 8; d++) {
for (int k = 1; k < st; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int ni = (i + dx[d] * (1 << (k - 1))) % n;
if (ni < 0) {
ni += n;
}
int nj = (j + dy[d] * (1 << (k - 1))) % m;
if (nj < 0) {
nj += m;
}
h[i][j][k].first = (h[i][j][k - 1].first * pw[k - 1].first + h[ni][nj][k - 1].first) % mod1;
h[i][j][k].second = (h[i][j][k - 1].second * pw[k - 1].second + h[ni][nj][k - 1].second) % mod2;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int ci = i;
int cj = j;
pair<long long, long long> X = {0, 0};
for (int k = 0; k < st; k++) {
if ((L >> k) & 1) {
X.first = (X.first * pw[k].first + h[ci][cj][k].first) % mod1;
X.second = (X.second * pw[k].first + h[ci][cj][k].second) % mod2;
ci = (ci + dx[d] * (1 << k)) % n;
if (ci < 0) {
ci += n;
}
cj = (cj + dy[d] * (1 << k)) % m;
if (cj < 0) {
cj += m;
}
}
}
cnt[X]++;
}
}
}
long long den = 1LL * (n * m) * (n * m) * 64;
long long num = 0;
for (auto p: cnt) {
num += 1LL * p.second * p.second;
}
long long g = __gcd(num, den);
num /= g;
den /= g;
cout << num << "/" << den;
}
// END MAIN CODE
Compilation message
osmosmjerka.cpp: In function 'void file_io(std::string, std::string)':
osmosmjerka.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | freopen(fi.c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
osmosmjerka.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | freopen(fo.c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
2 ms |
724 KB |
Output is correct |
| 5 |
Correct |
6 ms |
1492 KB |
Output is correct |
| 6 |
Correct |
41 ms |
7484 KB |
Output is correct |
| 7 |
Correct |
749 ms |
48844 KB |
Output is correct |
| 8 |
Correct |
3267 ms |
153572 KB |
Output is correct |
