# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640857 | Baytoro | Just Long Neckties (JOI20_ho_t1) | C++17 | 332 ms | 21688 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
if(n==0)
return 1;
if(n%2==1)
return binpow(a, n-1)*a;
else{
int b=binpow(a, n/2);
return b*b;
}
}
int c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
cin>>n;
vector<pair<int,int>> a(n+1);
vector<int> b(n),ans(n+1);
for(i=0;i<=n;i++){
cin>>a[i].fr;
a[i].sc=i;
}
for(i=0;i<n;i++)
cin>>b[i];
sort(all(a));
sort(all(b));
multiset<int> st;
int x=a[0].fr;
for(i=1;i<=n;i++){
st.insert(a[i].fr-b[i-1]);
}
ans[a[0].sc]=*(st.rbegin());
for(i=1;i<=n;i++){
st.erase(st.find(a[i].fr-b[i-1]));
st.insert(a[i-1].fr-b[i-1]);
ans[a[i].sc]=*st.rbegin();
}
for(i=0;i<=n;i++)
cout<<ans[i]<<' ';
cout<<endl;
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |