#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 vector<pi> vpi;
//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); cout.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=1e18){//(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();
}
void solve() {
int n;
cin >> n;
vvl a(n,vl(3));//{x,h,v}
for(int j=0; j<3;j++)
for(int i=0; i<n;i ++)
cin >> a[i][j];
assert(is_sorted(all(a)));
vl ans(n,-1);
int mxe=0;
for(int i=0; i<n; i++)
if(!a[i][1])
mxe=a[i][0];
vvl c,e;
for(int i=0; i<n;i++){
if(!a[i][1])
e.pb({a[i][2],a[i][0]});
else
c.pb({a[i][2],a[i][0]});
sort(all(e));
sort(all(c));
if(a[i][0]<mxe)
continue;
if(e.size()>c.size())
continue;
ll mn=1e9;
int l=0,r=a[i][0];
while(l<=r){
int m=(l+r)/2;
bool ok=1;
for(int i=0,j=0;ok && i<e.size(); i++){
while(j<c.size() && (c[j][0]>e[i][0] || (c[j][1]<e[i][1] && c[j][1]<m)))
j++;
if(j==c.size())
ok=0;
j++;
}
if(ok)
mn=m,l=m+1;
else
r=m-1;
}
if(mn==1e9)
ans[i]=-1;
else
ans[i]=2*a[i][0]-mn;
}
print(ans)
}
Compilation message
santa.cpp: In function 'void solve()':
santa.cpp:153:36: 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]
153 | for(int i=0,j=0;ok && i<e.size(); i++){
| ~^~~~~~~~~
santa.cpp:154:24: 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]
154 | while(j<c.size() && (c[j][0]>e[i][0] || (c[j][1]<e[i][1] && c[j][1]<m)))
| ~^~~~~~~~~
santa.cpp:156:21: 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]
156 | if(j==c.size())
| ~^~~~~~~~~~
santa.cpp: In function 'void usaco(std::string)':
santa.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
santa.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Incorrect |
4 ms |
332 KB |
Output isn't correct |
| 3 |
Incorrect |
414 ms |
564 KB |
Output isn't correct |
| 4 |
Execution timed out |
1085 ms |
1012 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1096 ms |
1232 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1094 ms |
1960 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1082 ms |
3052 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1093 ms |
3984 KB |
Time limit exceeded |
| 9 |
Execution timed out |
1090 ms |
8236 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1084 ms |
8364 KB |
Time limit exceeded |
