#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
#define ll long long
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;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
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(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> void print(Tree <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 << "]";}
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
// 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 if(str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
const int N = 6e5 + 10, inf = 1e8, infi = 2e9 + 10;
vector<pair<int, int>> to_add[N], to_erase[N];
int n, k, q, answ[N];
struct node {
int x, t, a, b;
};
vector<node> cand;
struct segTreeMax { // Range Queries
multiset<int> mt[N * 4];
vector<int> mTree;
int size;
void init(ll n) {
size = 1;
while(size < n) {
size *= 2;
}
mTree.assign(2 * size - 1, 0);
}
void upd(int u, ll v, int x, int lx, int rx) { // set value at pos u
if(rx - lx == 1) {
if(v >= 0) {
mt[x].insert(v);
} else {
assert(mt[x].find(-v) != mt[x].end());
mt[x].erase(mt[x].find(-v));
}
if(!mt[x].empty()) {
mTree[x] = *prev(mt[x].end());
} else {
mTree[x] = 0;
}
return;
}
int m = (lx + rx) / 2;
if(u < m) {
upd(u, v, 2 * x + 1, lx, m);
}else {
upd(u, v, 2 * x + 2, m, rx);
}
mTree[x] = max(mTree[2 * x + 1], mTree[2 * x + 2]);
}
void upd(int u, ll v) {
upd(u, v, 0, 0, size);
}
int qry(int l, int r, int x, int lx, int rx) { // range queries
if(l >= rx || lx >= r) {
return -1;
}
if(lx >= l && r >= rx) {
return mTree[x];
}
int m = (rx + lx) / 2;
int s1 = qry(l, r, 2 * x + 1, lx, m);
int s2 = qry(l, r, 2 * x + 2, m, rx);
return max(s1, s2);
}
int qry(int l, int r) {
return qry(l, r, 0,0,size);
}
};
struct segTreeMin { // Range Queries
multiset<int> mt[N * 4];
vector<int> mTree;
int size;
void init(ll n) {
size = 1;
while(size < n) {
size *= 2;
}
mTree.assign(2 * size - 1, INT32_MAX);
}
void upd(int u, ll v, int x, int lx, int rx) { // set value at pos u
if(rx - lx == 1) {
if(v >= 0) {
mt[x].insert(v);
} else {
assert(mt[x].find(-v) != mt[x].end());
mt[x].erase(mt[x].find(-v));
}
if(!mt[x].empty()) {
mTree[x] = *mt[x].begin();
} else {
mTree[x] = -1;
}
return;
}
int m = (lx + rx) / 2;
if(u < m) {
upd(u, v, 2 * x + 1, lx, m);
}else {
upd(u, v, 2 * x + 2, m, rx);
}
mTree[x] = min(mTree[2 * x + 1], mTree[2 * x + 2]);
}
void upd(int u, ll v) {
upd(u, v, 0, 0, size);
}
int qry(int l, int r, int x, int lx, int rx) { // range queries
if(l >= rx || lx >= r) {
return INT32_MAX;
}
if(lx >= l && r >= rx) {
return mTree[x];
}
int m = (rx + lx) / 2;
int s1 = qry(l, r, 2 * x + 1, lx, m);
int s2 = qry(l, r, 2 * x + 2, m, rx);
return min(s1, s2);
}
int qry(int l, int r) {
return qry(l, r, 0,0,size);
}
};
segTreeMax rs;
segTreeMin ls;
vector<int> compress_times, compress_locations;
multiset<int> color[N];
map<pair<int, int>, int> col[N];
map<int, int> mx_col[N];
vector<pair<int, int>> qr[N];
int pat[N];
int first_element, last_element;
void add_interval(int type, int l, int r) {
int mid = (l + r + 1) / 2;
l = lower_bound(all(compress_locations), l) - compress_locations.begin();
r = lower_bound(all(compress_locations), r) - compress_locations.begin();
mid = lower_bound(all(compress_locations), mid) - compress_locations.begin();
int midone = lower_bound(all(compress_locations), mid - 1) - compress_locations.begin();
if(mid <= r) {
rs.upd(mid, r);
}
if(l < mid) {
ls.upd(midone, l);
}
}
void del_interval(int type, int l, int r) {
int mid = (l + r + 1) / 2;
l = lower_bound(all(compress_locations), l) - compress_locations.begin();
r = lower_bound(all(compress_locations), r) - compress_locations.begin();
mid = lower_bound(all(compress_locations), mid) - compress_locations.begin();
int midone = lower_bound(all(compress_locations), mid - 1) - compress_locations.begin();
if(mid <= r) rs.upd(mid, -r);
if(l < mid) ls.upd(midone, -l);
}
void solve_() {
cin >> n >> k >> q;
compress_locations.push_back(0);
compress_locations.push_back(1);
compress_locations.push_back(inf);
for(int i = 1; i <= n; i++) {
int x, t, a, b;
cin >> x >> t >> a >> b;
compress_times.push_back(a);
compress_times.push_back(b + 1);
compress_locations.push_back(x);
cand.push_back({x, t, a, b});
}
vector<pair<int, int>> queries;
for(int i = 1; i <= q; i++) {
int l, y; cin >> l >> y;
compress_locations.push_back(l);
compress_times.push_back(y);
queries.emplace_back(l, y);
}
compress_locations.push_back(-infi);
compress_locations.push_back(infi);
sort(all(compress_times));
uniq(compress_times);
for(auto &i: cand) {
i.a = lower_bound(all(compress_times), i.a) - compress_times.begin();
i.b = lower_bound(all(compress_times), i.b + 1) - compress_times.begin();
to_add[i.a].push_back({i.x, i.t});
to_erase[i.b].push_back({i.x, i.t});
}
for(int i = 1; i <= k; i++) {
color[i].insert(-infi);
color[i].insert(infi);
}
for(int i = 0; i < sz(compress_times); i++) {
for(auto j: to_add[i]) {
if(color[j.second].find(j.first) != color[j.second].end()) {
mx_col[j.second][j.first]++;
continue;
}
color[j.second].insert(j.first);
mx_col[j.second][j.first] = 1;
auto it = color[j.second].find(j.first);
auto it_prev = prev(it), it_next = next(it);
int mid1 = (*it_next + j.first + 1) / 2;
int mid2 = (*it_prev + j.first + 1) / 2;
compress_locations.push_back(mid1);
compress_locations.push_back(mid1 - 1);
compress_locations.push_back(mid2);
compress_locations.push_back(mid2 - 1);
}
// tex, tip
for(auto j: to_erase[i]) {
// color[j.second]
mx_col[j.second][j.first]--;
if(mx_col[j.second][j.first] == 0) {
auto it = color[j.second].find(j.first);
auto it_prev = prev(it), it_next = next(it);
int mid1 = (*it_next + *it_prev + 1) / 2;
compress_locations.push_back(mid1);
compress_locations.push_back(mid1 - 1);
color[j.second].erase(j.first);
}
}
}
int it = 1;
for(auto &i: queries) {
i.second = lower_bound(all(compress_times), i.second) - compress_times.begin();
qr[i.second].emplace_back(i.first, it);
it++;
}
sort(all(compress_locations));
uniq(compress_locations);
ls.init(sz(compress_locations) + 10);
rs.init(sz(compress_locations) + 10);
for(int i = 1; i <= k; i++) {
color[i].clear();
mx_col[i].clear();
color[i].insert(-infi);
color[i].insert(infi);
}
first_element = 0;
last_element = sz(compress_locations) - 1;
vector<bool> empty(k + 1, true);
int emp = k;
for(int i = 0; i < sz(compress_times); i++) {
for(auto j: to_add[i]) {
if(color[j.second].find(j.first) != color[j.second].end()) {
mx_col[j.second][j.first]++;
continue;
}
mx_col[j.second][j.first] = 1;
color[j.second].insert(j.first);
if(sz(color[j.second]) == 3) {
assert(empty[j.second]);
empty[j.second] = false;
emp--;
}
// ete inchvor bani aranqna
auto it = color[j.second].find(j.first);
assert(it != color[j.second].begin());
assert(it != prev(color[j.second].end()));
auto it_prev = prev(it), it_next = next(it);
int mid1 = (*it_next + j.first + 1) / 2;
int mid2 = (*it_prev + j.first + 1) / 2;
add_interval(j.second, *it_prev, j.first);
add_interval(j.second, j.first, *it_next);
if(*it_prev != -infi || *it_next != infi) {
del_interval(j.second, *it_prev, *it_next);
}
}
// tex, tip
for(auto j: to_erase[i]) {
mx_col[j.second][j.first]--;
if(mx_col[j.second][j.first] == 0) {
auto it = color[j.second].find(j.first);
if(sz(color[j.second]) == 3) {
empty[j.second] = true;
emp++;
}
auto it_prev = prev(it), it_next = next(it);
del_interval(j.second, *it_prev, j.first);
del_interval(j.second, j.first, *it_next);
if(*it_prev != -infi || *it_next != infi) {
add_interval(j.second, *it_prev, *it_next);
}
color[j.second].erase(j.first);
}
}
for(auto j: qr[i]) {
if(emp) {
pat[j.second] = -1;
} else {
int cur = lower_bound(all(compress_locations), j.first) - compress_locations.begin();
int li = ls.qry(cur + 1, sz(compress_locations) + 1);
int ri = rs.qry(0, cur);
if(li != INT32_MAX && li <= cur) {
pat[j.second] = max(pat[j.second], j.first - compress_locations[li]);
}
if(ri != -1 && ri >= cur) {
pat[j.second] = max(pat[j.second], compress_locations[ri] - j.first);
}
}
}
}
for(int i = 1; i <= q; i++) {
cout << pat[i] << '\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
new_home.cpp: In function 'void solve_()':
new_home.cpp:397:11: warning: unused variable 'mid1' [-Wunused-variable]
397 | int mid1 = (*it_next + j.first + 1) / 2;
| ^~~~
new_home.cpp:398:11: warning: unused variable 'mid2' [-Wunused-variable]
398 | int mid2 = (*it_prev + j.first + 1) / 2;
| ^~~~
new_home.cpp: In function 'void setIO(std::string)':
new_home.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
76 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
77 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
79 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
80 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
146 ms |
352580 KB |
Output is correct |
| 2 |
Correct |
138 ms |
352528 KB |
Output is correct |
| 3 |
Correct |
141 ms |
352576 KB |
Output is correct |
| 4 |
Incorrect |
135 ms |
352572 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
146 ms |
352580 KB |
Output is correct |
| 2 |
Correct |
138 ms |
352528 KB |
Output is correct |
| 3 |
Correct |
141 ms |
352576 KB |
Output is correct |
| 4 |
Incorrect |
135 ms |
352572 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1539 ms |
858360 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5064 ms |
478744 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
146 ms |
352580 KB |
Output is correct |
| 2 |
Correct |
138 ms |
352528 KB |
Output is correct |
| 3 |
Correct |
141 ms |
352576 KB |
Output is correct |
| 4 |
Incorrect |
135 ms |
352572 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
146 ms |
352580 KB |
Output is correct |
| 2 |
Correct |
138 ms |
352528 KB |
Output is correct |
| 3 |
Correct |
141 ms |
352576 KB |
Output is correct |
| 4 |
Incorrect |
135 ms |
352572 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
