#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include <time.h>
#endif
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;
int n, m, r, c;
set<ii> river;
vvi grid;
vvi r_seg;
int mnc, mxc;
void init(int nn, int mm, int sr, int sc, int l, char* s) {
n = nn, m = mm, r = sr, c = sc;
r--; c--;
mnc = mxc = c;
grid = vvi(n, vi(m));
river.insert({r, c});
grid[r][c] = 1;
for (int i=0; i<l; i++) {
if (s[i] == 'N') r--;
if (s[i] == 'S') r++;
if (s[i] == 'W') c--;
if (s[i] == 'E') c++;
river.insert({r, c});
grid[r][c] = 1;
mnc = min(mnc, c);
mxc = max(mxc, c);
}
if (n == 2) {
r_seg = vvi(2, vi(m));
if (grid[0][0]) r_seg[0][0] = 1;
for (int i=1; i<m; i++) {
if (grid[0][i] && !grid[0][i - 1]) r_seg[0][i] = r_seg[0][i - 1] + 1;
else r_seg[0][i] = r_seg[0][i - 1];
}
if (grid[1][0]) r_seg[1][0] = 1;
for (int i=1; i<m; i++) {
if (grid[1][i] && !grid[1][i - 1]) r_seg[1][i] = r_seg[1][i - 1] + 1;
else r_seg[1][i] = r_seg[1][i - 1];
}
}
}
int colour(int a, int b, int c, int d) {
a--, b--, c--, d--;
if (n == 2 && a == c) {
return r_seg[a][d] - r_seg[a][b] - grid[a][d] + 1;
}
if (n == 2) {
int ans = 0;
if (b < mnc) {
if (grid[0][mnc] && grid[1][mnc]) ans++;
b = mnc;
}
if (d > mxc) {
if (grid[0][mxc] && grid[1][mxc]) ans++;
d = mxc;
}
return r_seg[a][d] - r_seg[a][b] - grid[a][d] + 1 + r_seg[c][d] - r_seg[c][b] - grid[c][d] + 1;
}
int ans = 0;
vvi idx(n, vi(m, -1));
for (int i=a; i<=c; i++) {
for (int j=b; j<=d; j++) if (!grid[i][j] && idx[i][j] == -1) {
int cid = ans++;
queue<ii> q; q.push({i, j});
while (!q.empty()) {
auto [x, y] = q.front(); q.pop();
if (grid[x][y]) continue;
idx[x][y] = cid;
if (a <= x - 1 && !grid[x - 1][y] && idx[x - 1][y] == -1) q.push({x - 1, y});
if (c >= x + 1 && !grid[x + 1][y] && idx[x + 1][y] == -1) q.push({x + 1, y});
if (b <= y - 1 && !grid[x][y - 1] && idx[x][y - 1] == -1) q.push({x, y - 1});
if (d >= y + 1 && !grid[x][y + 1] && idx[x][y + 1] == -1) q.push({x, y + 1});
}
}
}
return ans;
}
//
// void solve() {
// int n, m, l, q; cin >> n >> m >> l >> q;
// int r, c; cin >> r >> c;
// string s; if (m) cin >> s;
//
// char ss[s.size()];
// for (int i=0; i<s.size(); i++) ss[i] = s[i];
//
// init(n, m, r, c, l, ss);
// while (q--) {
// int a, b, c, d; cin >> a >> b >> c >> d;
// cout << colours(a, b, c, d) << "\n";
// }
//
// }
//
// int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(NULL);
//
// clock_t start = clock();
//
// int test_cases = 1;
// /* cin >> test_cases; */
//
// while (test_cases--)
// solve();
//
// #ifdef DEBUG
// cerr << fixed << setprecision(10)
// << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
// << "s\n";
// #endif
// return 0;
// }
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
340 KB |
Output is correct |
| 2 |
Execution timed out |
3061 ms |
28300 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
70 ms |
10544 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Runtime error |
447 ms |
1048576 KB |
Execution killed with signal 9 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
340 KB |
Output is correct |
| 2 |
Execution timed out |
3061 ms |
28300 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
340 KB |
Output is correct |
| 2 |
Execution timed out |
3061 ms |
28300 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
