Submission #1173199

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173199		manuelalejandro	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	63 ms	11608 KiB

ho_t1

#include <bits/extc++.h>

#define int long long 
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define tam(x)  (int)(x).size()
#define endl '\n'
#define sd second
#define fs first
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define optmizar_io  ios_base::sync_with_stdio(0); cin.tie(0);
#define Setpre(n) cout << fixed <<setprecision(n)
#define dbg(x) for(auto y: x) cout << y <<' '; cout << endl;
#define dbg1(x) for(auto y: x) cout << y.first <<' '<< y.second << endl;
#define dbg2(v) for(auto x: v) cout << x.a<< ' '<< x.b <<' '<< x.c << endl;

const int MAX = 501;
const int INF = 1e9;
const int Mod = 1e9+7;
const int zero = 0;
const double eps = 1e-6;
const double PI=acos(-1.0);
const int mox[8] ={-1,1,0,0,-1,-1,1,1};
const int moy[8] ={0,0,-1,1,-1,1,-1,1};

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
typedef vector<bool> vbol;
typedef array<int, 3> arr;

template <typename T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;


void cases(string s){
#ifndef ONLINE_JUDGE
    if(tam(s) == 0) s = "1"; 
    string a = s + ".in";
    string b = s + ".out";
    freopen(a.c_str(), "r", stdin);
    freopen(b.c_str(), "w",  stdout);
#endif
}


void _1()
{
    int n; cin >> n;
    vector<pi> ar1(n + 1);
    vi ar2(n), pref(n + 10, 0), suf(n + 10, 0), ans(n + 10);

    for(int i = 0; i < n + 1; i++)
    {
        cin >> ar1[i].first; ar1[i].second = i;
    }
    for(auto &x : ar2) cin >> x;

    sort(all(ar1));
    sort(all(ar2));



    for(int i = 0; i < n; i++)
        (i == 0) ? pref[i + 1] = max(zero, ar1[i].first - ar2[i]) : pref[i + 1] = max(pref[i], max(zero, ar1[i].first - ar2[i]));
    for(int i = n; i > 0; i--)
        (i == n + 1) ? suf[i + 1] = max(zero, ar1[i].first - ar2[i - 1]) : suf[i + 1] = max(suf[i + 2], max(zero, ar1[i].first - ar2[i - 1]));

    for(int i = 0; i < n + 1; i++)
    {
        ans[ar1[i].second] = max(pref[i], suf[i + 2]);
    }

    // for(int i = 0; i <= n + 2; i++) cout << pref[i] << " "; cout << endl;
    // for(int i = 0; i <= n + 2; i++) cout << suf[i] << " "; cout << endl;

    for(int i = 0; i < n + 1; i++) cout << ans[i] << " ";
    cout << endl;

}


    

int32_t main() {
    optmizar_io 
    // cases("");

    //start:  
    //end: 
    //tags: 
    //difficulty:
    //comment: 
    
    int T = 1; //cin >> T;
    while(T--)
        _1();


    return 0;
}

Compilation message (stderr)

ho_t1.cpp: In function 'void cases(std::string)':
ho_t1.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen(a.c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(b.c_str(), "w",  stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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