# 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;
}*/
const int N = 3e5 + 5;
int t,n,m,a[N],x[N],y[N],xt[N],yt[N],par[N],xx[N],yy[N];
vector <pii> vx;
set < pii > s;
int check(int up, int d) {
return (x[up] <= x[d] && y[up] <= y[d] && xt[up] >= xt[d] && yt[up] >= yt[d]);
}
int tree[4 * N], lazy[4 * N];
int merge(int a, int b) {
return max(a,b);
}
void build(int node, int le, int ri) {
lazy[node] = -1; tree[node] = 0;
if (le == ri) {
return ;
}
int mid = (le + ri) / 2;
build(2 * node,le,mid);
build(2 * node + 1, mid + 1, ri);
}
void push(int node, int le, int ri) {
if (lazy[node] == -1) return ;
tree[node] = lazy[node];
if (le != ri) {
lazy[2 * node] = lazy[node];
lazy[2 * node + 1] = lazy[node];
}
lazy[node] = -1;
}
void update(int node, int le, int ri, int start, int end, int val) {
push(node,le,ri);
if (le > end || ri < start) return ;
if (le >= start && ri <= end) {
lazy[node] = val;
push(node,le,ri);
return ;
}
int mid = (le + ri) / 2;
update(2 * node,le,mid,start,end,val);
update(2 * node + 1, mid + 1, ri, start, end,val);
tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
int getans(int node, int le, int ri, int start, int end) {
push(node,le,ri);
if (le > end || ri < start) return 0;
if (le >= start && ri <= end) {
return tree[node];
}
int mid = (le + ri) / 2;
return merge(getans(2 * node, le, mid,start,end), getans(2 * node + 1, mid + 1, ri, start, end));
}
vector <int> v[N];
set <int> sc[N];
int ans[N],col[N];
map <int, int> mp;
void dfs(int a, int p) {
for (int to : v[a]) {
if (to == p) continue;
dfs(to,a);
if (sc[a].size() < sc[to].size()) swap(sc[a],sc[to]);
for (int x : sc[to]) sc[a].insert(x);
}
ans[a] = sc[a].size();
}
main() {
ios_base::sync_with_stdio(false),
cin.tie(NULL),cout.tie(NULL);
cin>>n>>m;
vector <int> tocomp;
for(int i = 1; i <= n; i++) {
cin>>x[i]>>y[i]>>xt[i]>>yt[i];
vx.pb({x[i],i});
vx.pb({xt[i] + 1,-i});
}
sort(vx.begin(),vx.end());
for (int i = 0; i < vx.size(); i++) {
int id = abs(vx[i].s);
if (vx[i].s > 0) {
auto it = s.lower_bound({yt[id], 0});
if (it == s.end()) {
par[id] = -1;
}
else {
int x = (*it).s;
if (check(x, id)) {
par[id] = x;
} else {
par[id] = par[x];
}
}
s.insert({yt[id], id});
} else {
s.erase({yt[id], id});
}
}
for (int i = 1; i <= n; i++) {
if (par[i] == -1) {
par[i] = 0;
}
v[par[i]].pb(i);
}
vector <pii> colx;
tocomp.clear();
for (int i = 1; i <= m; i++){
cin>>xx[i]>>yy[i]>>col[i];
tocomp.pb(yy[i]);
colx.pb({xx[i], i});
}
for (int i = 1; i <= n; i++) {
tocomp.pb(y[i]);
tocomp.pb(yt[i]);
}
sort(tocomp.begin(),tocomp.end());
int cnt = 0;
for (int i = 0; i < tocomp.size(); i++) {
if (i == 0 || tocomp[i] != tocomp[i - 1]) cnt++;
mp[tocomp[i]] = cnt;
}
for(int i = 1; i <= n; i++) {
y[i] = mp[y[i]];
yt[i] = mp[yt[i]];
//cout<<y[i]<<" "<<yt[i]<<"\n";
}
for (int i = 1; i <= m; i++) yy[i] = mp[yy[i]];
set <int> s;
int cur = 0;
int mx = 200000;
sort(colx.begin(),colx.end());
build(1,1,mx);
for (pii p : colx) {
int x = p.f;
//cout<<"Point "<<p.f<<" "<<yy[p.s]<<"\n";
while (cur < vx.size() && vx[cur].f <= x) {
int id = abs(vx[cur].s);
//cout<<id<<" ";
if (vx[cur].s > 0) {
//cout<<y[id]<<" + "<<yt[id]<<" "<<endl;
update(1,1,mx,y[id],yt[id],id);
} else {
update(1,1,mx,y[id],yt[id],0);
//cout<<y[id]<<" - "<<yt[id]<<"\n";
if (par[id]) update(1,1,mx,y[id],yt[id],par[id]);//, cout<<y[id]<<" "<<yt[id]<<"\n";
}
cur++;
}
int rect = getans(1,1,mx,yy[p.s],yy[p.s]);
if (rect) sc[rect].insert(col[p.s]);
}
dfs(0, -1);
for (int i = 1; i <= n ;i++) {
cout<<ans[i]<<"\n";
}
}
Compilation message
plahte.cpp:273:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
273 | main() {
| ^~~~
plahte.cpp: In function 'int main()':
plahte.cpp:284:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
284 | for (int i = 0; i < vx.size(); i++) {
| ~~^~~~~~~~~~~
plahte.cpp:323:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
323 | for (int i = 0; i < tocomp.size(); i++) {
| ~~^~~~~~~~~~~~~~~
plahte.cpp:341:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
341 | while (cur < vx.size() && vx[cur].f <= x) {
| ~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
112 ms |
35472 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
156 ms |
37472 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
243 ms |
46544 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
398 ms |
57548 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
380 ms |
55236 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
