# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
//#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
//const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
//#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define int long long
#define pb push_back
const int N = 505, mod = 1e9 + 7, p = 31;
int t,n,m,k,a[N];
char ch[N][N];
int dx[] = {1,1,1,-1,-1,-1,0,0};
int dy[] = {1,0,-1,1,0,-1,1,-1};
int hs[9][N][N][32];
int f_p(int base, int power) {
int result = 1;
while (power > 0) {
if (power % 2) result = (result * base) % mod;
base = (base * base) % mod;
power /= 2;
}
return result;
}
int getx(int x, int i, int ad) {
int newx = (x + (1<<i) * ad) % n; newx += n; newx %= n; if (newx == 0) newx = n;
return newx;
}
int gety(int y, int i, int ad) {
int newy = (y + (1<<i) * ad) % m; newy += m; newy %= m; if (newy == 0) newy = m;
return newy;
}
int get(int x, int y, int sz) {
return (x * f_p(p,sz) + y) % mod;
}
void go(int x, int y) {
int gc = __gcd(x,y);
x /= gc; y /= gc;
cout<<x<<"/"<<y<<"\n";
}
int get(char ch) {
return (int)(ch - 'a' + 1);
}
map <int, int> mp;
set <int> s;
void prnt(int x, int y, int k, int ty){
int curx = x; int cury = y;
for (int i = 0; i < k; i++) {
cout<<ch[curx][cury];
curx = getx(curx,0,dx[ty]);
cury = gety(cury,0,dy[ty]);
}
cout<<"\n";
}
main() {
//std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n>>m>>k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin>>ch[i][j];
}
}
for (int ty = 0; ty < 8; ty++) {
for (int i = 0; i <= 31; i++) {
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= m; y++) {
if (i == 0) {
hs[ty][x][y][i] = get(ch[x][y]);
continue;
}
int newx = getx(x,i - 1,dx[ty]);
int newy = gety(y,i - 1,dy[ty]);
hs[ty][x][y][i] = get(hs[ty][x][y][i - 1], hs[ty][newx][newy][i - 1], (1<<(i - 1)));
}
}
}
}
for (int ty = 0; ty < 8; ty++) {
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= m; y++) {
int ans = 0;
int curx = x, cury = y, cursz = 0;
for (int j = 31; j >= 0; j--) {
if ((1<<j)&k) ans = get(ans, hs[ty][curx][cury][j], cursz), curx = getx(curx,j,dx[ty]), cury = gety(cury,j,dy[ty]), ans %= mod, cursz += (1<<j);
}
mp[ans]++;
s.insert(ans);
}
}
}
int raod = 0;
for (int x : s) {
raod += mp[x] * mp[x];
}
go(raod, n * m * 8 * n * m * 8);
}
Compilation message
osmosmjerka.cpp:228:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
228 | main() {
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
3 ms |
852 KB |
Output is correct |
| 4 |
Correct |
9 ms |
1876 KB |
Output is correct |
| 5 |
Correct |
38 ms |
5108 KB |
Output is correct |
| 6 |
Correct |
221 ms |
24776 KB |
Output is correct |
| 7 |
Incorrect |
2764 ms |
161040 KB |
Output isn't correct |
| 8 |
Runtime error |
2132 ms |
262144 KB |
Execution killed with signal 9 |
