//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
/*
struct node{
int s,e,m;
int val=0;
node *l,*r;
node (int _s,int _e){
s=_s,e=_e,m=s+e>>1;
if (s!=e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void update(int i){
val++;
if (s==e) return;
else if (i<=m) l->update(i);
else r->update(i);
}
int query(int i){
}
void clear(){
val=0;
if (s!=e){
l->clear(),r->clear();
}
}
} *root=new node(0,3005);
*/
int n;
int pos[100005];
int type[100005];
int val[100005];
int ans[100005];
multiset<int> s;
bool test(int l,int r){
s.clear();
rep(x,0,r+1){
if (x<l){
if (type[x]==0){
s.insert(val[x]);
}
}
else if (x==l){
rep(x,l,r+1) if (type[x]==0){
s.insert(val[x]);
}
}
if (type[x]==1){
auto it=s.lower_bound(val[x]);
if (it!=s.end()){
s.erase(it);
if (l<=x && s.empty()) return true;
}
}
}
return s.empty();
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int TC;
cin>>TC;
while (TC--){
cin>>n;
rep(x,0,n) cin>>pos[x];
rep(x,0,n) cin>>type[x];
rep(x,0,n) cin>>val[x];
bool bad=false;
int curr=n-1;
rep(x,n,0){
if (bad) ans[x]=-1;
else{
while (curr>x || !test(curr,x)){
curr--;
}
//cout<<x<<" "<<curr<<endl;
if (curr==-1){
bad=true;
ans[x]=-1;
}
else{
ans[x]=2*pos[x]-pos[curr];
}
}
if (type[x]==0) bad=true;
}
rep(x,0,n) cout<<ans[x]<<" "; cout<<endl;
}
}
Compilation message
santa.cpp: In function 'int main()':
santa.cpp:19:26: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
^
santa.cpp:141:3: note: in expansion of macro 'rep'
rep(x,0,n) cout<<ans[x]<<" "; cout<<endl;
^~~
santa.cpp:141:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
rep(x,0,n) cout<<ans[x]<<" "; cout<<endl;
^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
6 ms |
384 KB |
Output is correct |
| 3 |
Correct |
625 ms |
508 KB |
Output is correct |
| 4 |
Execution timed out |
1084 ms |
596 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1092 ms |
668 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1091 ms |
512 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1088 ms |
768 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1088 ms |
1152 KB |
Time limit exceeded |
| 9 |
Execution timed out |
1091 ms |
1784 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1034 ms |
2040 KB |
Time limit exceeded |
