#include "rainbow.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
int ar, ac, br, bc, ans;
set < pii > q, qq, was;
void init(int R, int C, int sr, int sc, int M, char *S) {
q.insert(mp(sr, sc));
for (int i = 0; i < M; ++i) {
if (S[i] == 'N')
--sr;
else if (S[i] == 'S')
++sr;
else if (S[i] == 'W')
--sc;
else
++sc;
q.insert(mp(sr, sc));
}
}
bool in (int x, int y) {
return ar <= x && x <= br && ac <= y && y <= bc;
}
void dfs (pii x) {
was.insert(x);
for (int i = 0; i < 4; ++i) {
int tox = x.f + dx[i], toy = x.s + dy[i];
if (!was.count(mp(tox, toy)) && qq.count(mp(tox, toy)))
dfs(mp(tox, toy));
}
}
int colour(int Ar, int Ac, int Br, int Bc) {
bool ok = 0;
for (auto x : q)
if (in(x.f, x.s) && x.f == Ar || x.f == Br || x.s == Ac || x.s == Bc) {
ok = 1;
break;
}
if (!ok)
return 1;
ar = Ar, ac = Ac, br = Br, bc = Bc;
for (int i = Ar - 1; i <= Br + 1; ++i) {
q.insert(mp(i, Ac - 1));
q.insert(mp(i, Bc + 1));
}
for (int j = Ac - 1; j <= Bc + 1; ++j) {
q.insert(mp(Ar - 1, j));
q.insert(mp(Br + 1, j));
}
for (auto x : q)
for (int i = 0; i < 4; ++i) {
int tox = x.f + dx[i], toy = x.s + dy[i];
if (in(tox, toy) && !q.count(mp(tox, toy)))
qq.insert(mp(tox, toy));
}
ans = 0;
for (auto x : qq)
if (!was.count(x)) {
dfs(x);
++ans;
}
return ans;
}
Compilation message
rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:83:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
83 | if (in(x.f, x.s) && x.f == Ar || x.f == Br || x.s == Ac || x.s == Bc) {
| ~~~~~~~~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
35 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct |
| 2 |
Correct |
755 ms |
72568 KB |
Output is correct |
| 3 |
Correct |
765 ms |
72632 KB |
Output is correct |
| 4 |
Incorrect |
558 ms |
50680 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
35 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
35 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
