| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 866684 |
2023-10-26T17:14:59 Z |
efedmrlr |
Park (BOI16_park) |
C++17 |
|
2500 ms |
33628 KB |
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 4e6+500;
const int M = 2e3+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,w,h;
int curr;
vector<pair<array<int,2> , int> > tre;
vector<array<int,2> > quer;
struct DSU {
vector<int> p, sz;
void rsz() {
p.resize(N);
sz.resize(N);
}
void reset() {
for(int i = 0; i<n+20; i++) {
make_set(i);
}
}
void make_set(int x) {
p[x] = x;
sz[x] = 1;
}
int find_set(int x) {
if(x == p[x]) return x;
return p[x] = find_set(p[x]);
}
void union_set(int x, int y){
x = find_set(x); y = find_set(y);
if(x == y) return;
if(sz[x] < sz[y]) swap(x,y);
p[y] = x;
sz[x] += sz[y];
}
};
DSU ds;
int eucl_d(array<int,2> a, array<int,2> b) {
array<int,2> c = {a[0] - b[0], a[1] - b[1]};
return c[0]*c[0] + c[1]*c[1];
}
bool is_in_dist(array<int,2> a, array<int,2> b, int dst) {
return eucl_d(a,b) < (dst * dst);
}
void onion(int x, int y) {
if(is_in_dist(tre[x].first, tre[y].first, tre[x].second + tre[y].second + curr)) {
ds.union_set(x,y);
}
}
bool is_valid(int r, int e1, int e2) {
if(e1 > e2) swap(e1, e2);
if(e1 == e2) return 1;
ds.reset();
r*=2;
curr = r;
// x = n (floor)
for(int i = 0; i<n; i++) {
if(tre[i].first[1] - tre[i].second < curr) {
ds.union_set(n, i);
}
}
//x = n+1 (ceiling)
for(int i = 0; i<n; i++) {
if(h - (tre[i].first[1] + tre[i].second) < curr) {
ds.union_set(n + 1, i);
}
}
//x = n+2 (left)
for(int i = 0; i<n; i++) {
if(tre[i].first[0] - tre[i].second < curr) {
ds.union_set(n + 2, i);
}
}
//x = n+3 (right)
for(int i = 0; i<n; i++) {
if(w - (tre[i].first[0] + tre[i].second) < curr) {
ds.union_set(n + 3, i);
}
}
for(int i = 0; i<n; i++) {
for(int j = i + 1; j<n; j++) {
onion(i,j);
}
}
if(e1 == 1 && e2 == 2) {
if(ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n) == ds.find_set(n+2) || ds.find_set(n) == ds.find_set(n+3)) {
return 0;
}
return 1;
}
if(e1 == 1 && e2 == 3) {
if(ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n) == ds.find_set(n+2) || ds.find_set(n+1) == ds.find_set(n+3) || ds.find_set(n+2) == ds.find_set(n+3)) {
return 0;
}
return 1;
}
if(e1 == 1 && e2 == 4) {
if(ds.find_set(n+2) == ds.find_set(n) || ds.find_set(n+2) == ds.find_set(n+1) || ds.find_set(n+2) == ds.find_set(n+3)) {
return 0;
}
return 1;
}
if(e1 == 2 && e2 == 3) {
if(ds.find_set(n+3) == ds.find_set(n) || ds.find_set(n+3) == ds.find_set(n+1) || ds.find_set(n+3) == ds.find_set(n+2)) {
return 0;
}
return 1;
}
if(e1 == 2 && e2 == 4) {
if(ds.find_set(n) == ds.find_set(n+3) || ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n+2) == ds.find_set(n+3) || ds.find_set(n+1) == ds.find_set(n+2)) {
return 0;
}
return 1;
}
if(e1 == 3 && e2 == 4) {
if(ds.find_set(n+1) == ds.find_set(n) || ds.find_set(n+1) == ds.find_set(n+2) || ds.find_set(n+1) == ds.find_set(n+3)) {
return 0;
}
return 1;
}
assert(0);
return 0;
}
inline void solve() {
cin>>n>>m;
cin>>w>>h;
tre.resize(n);
quer.resize(m);
ds.rsz();
for(int i = 0; i<n; i++) {
cin>>tre[i].first[0]>>tre[i].first[1]>>tre[i].second;
}
for(int i = 0; i<m; i++) {
cin>>quer[i][0]>>quer[i][1];
}
for(int i = 0; i<m; i++) {
for(int e = 1; e<=4; e++) {
if(is_valid(quer[i][0], quer[i][1], e)) {
cout<<e;
}
}
cout<<"\n";
}
}
signed main() {
//freopen("milkvisits.in", "r", stdin);
//freopen("milkvisits.out", "w", stdout);
//fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
Compilation message
park.cpp: In function 'std::string to_string(std::string, int, int)':
park.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
| ~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
62 ms |
31580 KB |
Output is correct |
| 2 |
Incorrect |
69 ms |
31836 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2565 ms |
33628 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
62 ms |
31580 KB |
Output is correct |
| 2 |
Incorrect |
69 ms |
31836 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
