Submission #702473

#TimeUsernameProblemLanguageResultExecution timeMemory
7024731075508020060209tcJust Long Neckties (JOI20_ho_t1)C++14
100 / 100
432 ms23684 KiB
//#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define int long long #define X first #define Y second int n; int orgar[500005]; int ar[500005]; int br[500005]; int psans[500005]; int sfans[500005]; signed main(){ cin>>n; for(int i=1;i<=n+1;i++){ cin>>orgar[i]; ar[i]=orgar[i]; } for(int i=1;i<=n;i++){ cin>>br[i]; } sort(ar+1,ar+n+1+1); sort(br+1,br+n+1); for(int i=1;i<=n;i++){ psans[i]=max(psans[i-1],ar[i]-br[i]); } for(int i=n+1;i>=2;i--){ sfans[i]=max(sfans[i+1],ar[i]-br[i-1]); } map<int,int>mp; for(int i=1;i<=n+1;i++){ mp[ar[i]]=max(psans[i-1],sfans[i+1]); } for(int i=1;i<=n+1;i++){ cout<<mp[orgar[i]]<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...