///
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
} else {
// freopen("skis.in", "r", stdin);
// freopen("skis.out", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long mod = 1e9 + 7;
long long r, c, q;
long long qq[105][105], d[105][105];
long long add(long long a, long long b) {
return (a + b) % mod;
}
long long mult(long long a, long long b) {
return (a * b) % mod;
}
long long sub(long long a, long long b) {
return (a - b + 2 * mod) % mod;
}
void solve_() {
cin >> r >> c >> q;
while(q--) {
char t; cin >> t;
long long c1, c2; cin >> c1 >> c2;
if(t == 'P') {
if(c1 != c2) {
cout << "0 0" << '\n';
} else {
cout << r - 1 << " " << 1 << '\n';
}
} else if(t == 'R') {
if(c1 == c2) {
cout << "1 1" << '\n';
} else {
cout << "2 2" << '\n';
}
} else if(t == 'K') {
if(max(r, c) <= 100) {
memset(qq, 0, sizeof(qq));
memset(d, 0, sizeof(d));
qq[1][c1] = 1;
d[1][c1] = 1;
queue<pair<int, int>> q;
q.push({1, c1});
while (!q.empty()) {
auto u = q.front();
q.pop();
for(int i = 0; i < 8; i++) {
int nx = u.first + dx[i];
int ny = u.second + dy[i];
if(nx >= 1 && nx <= r && ny >= 1 && ny <= c) {
if(d[nx][ny] != d[u.first][u.second]) {
if(!d[nx][ny]) {
q.push({nx, ny});
}
d[nx][ny] = d[u.first][u.second] + 1;
qq[nx][ny] = add(qq[nx][ny], qq[u.first][u.second]);
}
}
}
}
cout << d[r][c2] - 1 << " " << qq[r][c2] << '\n';
}
}
}
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
for(int i = 1; i <= test_case; i++) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
chessrush.cpp: In function 'void setIO(std::string)':
chessrush.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
70 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
chessrush.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
468 KB |
Output is correct |
| 2 |
Correct |
22 ms |
464 KB |
Output is correct |
| 3 |
Correct |
20 ms |
468 KB |
Output is correct |
| 4 |
Correct |
2 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
468 KB |
Output is correct |
| 2 |
Correct |
22 ms |
464 KB |
Output is correct |
| 3 |
Correct |
20 ms |
468 KB |
Output is correct |
| 4 |
Correct |
2 ms |
468 KB |
Output is correct |
| 5 |
Correct |
134 ms |
496 KB |
Output is correct |
| 6 |
Correct |
44 ms |
468 KB |
Output is correct |
| 7 |
Correct |
402 ms |
508 KB |
Output is correct |
| 8 |
Correct |
448 ms |
500 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
468 KB |
Output is correct |
| 2 |
Correct |
22 ms |
464 KB |
Output is correct |
| 3 |
Correct |
20 ms |
468 KB |
Output is correct |
| 4 |
Correct |
2 ms |
468 KB |
Output is correct |
| 5 |
Correct |
134 ms |
496 KB |
Output is correct |
| 6 |
Correct |
44 ms |
468 KB |
Output is correct |
| 7 |
Correct |
402 ms |
508 KB |
Output is correct |
| 8 |
Correct |
448 ms |
500 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
468 KB |
Output is correct |
| 2 |
Correct |
22 ms |
464 KB |
Output is correct |
| 3 |
Correct |
20 ms |
468 KB |
Output is correct |
| 4 |
Correct |
2 ms |
468 KB |
Output is correct |
| 5 |
Correct |
134 ms |
496 KB |
Output is correct |
| 6 |
Correct |
44 ms |
468 KB |
Output is correct |
| 7 |
Correct |
402 ms |
508 KB |
Output is correct |
| 8 |
Correct |
448 ms |
500 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
