#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
int n=v.size();
for(int i=0; i<n; i++)
cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
vector<T>ans;
for(T t:a)
if(ans.empty() || t!=ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a,ll b){
ll ans=a/b;
if(a%b)ans++;
return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M
ll ans=1;
while(exp){
if(exp%2==1)ans=((ans%M)*(base%M))%M;
base=((base%M)*(base%M))%M;
exp/=2;
}
return ans;
}
string to_base(int n,int new_base){
string s;
int nn=n;
while(nn){
s+=to_string(nn%new_base);
nn/=new_base;
}
reverse(all(s));
return s;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll x= (a/gcd(a,b));
return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1){
if(mx==1e18+1)
mx=n;
vl ans(n);
for(int i=0; i<n;i++)
ans[i]=(mn+rand()%(mx-mn+1));
return ans;
}
string substr(string s,int l,int r){
string ans;
for(int i=l; i<=r; i++)
ans+=s[i];
return ans;
}
void solve();
int main(){
GLHF;
int t=1;
//cin >> t;
while(t--)
solve();
}
struct query{
ll l,y,id,ans;
query(ll l, ll y,ll id):l(l),y(y),id(id){}
};
bool cmp(vl v1,vl v2){
if(v1[0]>v2[0])return 0;
else if(v1[0]<v2[0])return 1;
if(v1[2]==0)return 1;
if(v2[2]==0)return 0;
if(v1[2]==2)return 1;
if(v2[2]==2)return 0;
return 0;
}
void solve() {
ll n,k,q;
cin >> n >> k >> q;
vvl a(n,vl(4));//{x,t,l,r}
for(int i=0; i<n; i++)
for(int j=0; j<4; j++)
cin >> a[i][j];
vector<query*>qs(q);
for(int i=0; i<q; i++){
ll l,y;
cin >> l >> y;
qs[i]=new query(l,y,i);
}
vector<multiset<ll>>pos(k+1);
vvl sweep;//{time,pos,type,id/store kind} 0-open, 1-close,2-query
vl ans(q);
for(int i=0; i<n; i++){
sweep.pb({a[i][3],a[i][0],1,a[i][1]});
sweep.pb({a[i][2],a[i][0],0,a[i][1]});
}
for(int i=0; i<q; i++)
sweep.pb({qs[i]->y,qs[i]->l,2,i});
sort(all(sweep),cmp);
for(int i=0; i<sweep.size(); i++){
if(sweep[i][2]==0)
pos[sweep[i][3]].insert(sweep[i][1]);
else if(sweep[i][2]==1) {
assert(pos[sweep[i][3]].count(sweep[i][1]));
pos[sweep[i][3]].erase(pos[sweep[i][3]].find(sweep[i][1]));
}
else{
for(int j=1; j<=k; j++) {
if (!pos[j].size()) {
ans[sweep[i][3]] = -1;
break;
}
auto lb=pos[j].lower_bound(sweep[i][1]);
ll v1=1e18,v2=1e18;
if(lb!=pos[j].end())
v1=abs(*lb-sweep[i][1]);
if(lb!=pos[j].begin())
lb--,v2=abs(*lb-sweep[i][1]);
assert(sweep[i][3]<ans.size());
ans[sweep[i][3]]=max(ans[sweep[i][3]],min(v1,v2));
}
}
}
for(int i=0; i<q; i++) {
cout << ans[i] << "\n";
}
}
Compilation message
new_home.cpp: In function 'void solve()':
new_home.cpp:157:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
157 | for(int i=0; i<sweep.size(); i++){
| ~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from new_home.cpp:1:
new_home.cpp:177:35: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
177 | assert(sweep[i][3]<ans.size());
new_home.cpp: In function 'void usaco(std::string)':
new_home.cpp:39:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
39 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
new_home.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
40 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
588 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
588 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
879 ms |
217040 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
702 ms |
211876 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
588 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
588 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
