Submission #379165

#	Time	Username	Problem	Language	Result	Execution time	Memory
379165		hackermub	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	114 ms	10092 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define float long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define uid uniform_int_distribution<int>
#define forn(i,st,n,inc) for(int i=st;i<n;i+=inc)
#define rforn(i,st,n,inc) for(int i=st-1;i>=n;i-=inc)
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7;//998244353;
const int64_t INF = 1e18;

ostream& operator<<(ostream& o,const string& s){
    for(auto c:s) o<<c;
    return o;
}

template<typename F,typename S>
ostream& operator<<(ostream& o,const pair<F,S>& p){
    o<<"["<<p.fi<<","<<p.se<<"]";
    return o;
}

template<typename... T,template<class...> class C>
ostream& operator<<(ostream& o,const C<T...>& v){
    o<<"[";
    int tot=0;
    for(auto x:v){ 
        o<<x;
        if(tot<v.size()-1) o<<",";
        tot++;
    }
    o<<"]";
    return o;
}

vector<string> vec_splitter(string s) {
    s += ',';
    vector<string> res;
    while(!s.empty()) {
        res.push_back(s.substr(0, s.find(',')));
        s = s.substr(s.find(',') + 1);
    }
    return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx, 
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; } 
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
    if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
    stringstream ss; ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, LINE_NUM, T...);
}

#ifdef OFFLINE
clock_t Tm=clock();
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...)
#endif

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie();
    //If you hack my code , You are gay
    int n;
    cin>>n;
    vector<pii> v(n+1);
    for(int i=0;i<=n;i++){
        cin>>v[i].fi;
        v[i].se=i;
    }
    vector<int> ara(n);
    for(int i=0;i<n;i++) cin>>ara[i];
    sort(all(ara));
    sort(all(v));
    vector<int> mx(n+1);
    for(int i=n-1;i>=0;i--) mx[i]=max(mx[i+1],v[i+1].fi-ara[i]);
    debug(mx);
    vector<int> ans(n+1);
    ans[v[0].se]=max(0,mx[0]);
    int p=0;
    for(int i=1;i<=n;i++){
        p=max(p,v[i-1].fi-ara[i-1]);
        ans[v[i].se]=max(p,mx[i]);
    }
    for(auto x:ans) cout<<x<<" ";
    //mara kha
    #ifdef OFFLINE
        cerr<<"Time = "<<(double)(clock()-Tm)/CLOCKS_PER_SEC;
    #endif
    return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91