Submission #567030

#	Time	Username	Problem	Language	Result	Execution time	Memory
567030		Uzouf	Just Long Neckties (JOI20_ho_t1)	C++14	Compilation error	0 ms	0 KiB

ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    int n; cin>>n;
    pair<int,int> a[n+1];
    int b[n],ans[n+1];
    for (int i=0;i<=n;i++) {
      cin>>a[i].first; a[i].second=i; ans[i]=0;
    }
    for (int i=0;i<n;i++) {
      cin>>b[i];
    }
    sort(a,a+(n+1));
    sort(b,b+n);

    int prfx[n+1],sfx[n+1];
    int z=0;

    for (int i=0;i<n;i++) {
      prfx[i]=max(z,a[i].first-b[i]);
      if (i>0) prfx[i]=max(prfx[i],prfx[i-1]);
    }
    for (int i=n;i>=1;i--) {
      sfx[i]=max(z,a[i].first-b[i-1]);
      if (i<n) sfx[i]=max(sfx[i],sfx[i+1]);
    }


    for (int i=0;i<=n;i++) {
      if (i>0) ans[a[i].second]=prfx[i-1];
      if (cl2<n) ans[a[i].second]=max(ans[a[i].second],cl2);
    }

    for (int i:ans) cout<<i<<' ';

}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:45:11: error: 'cl2' was not declared in this scope
   45 |       if (cl2<n) ans[a[i].second]=max(ans[a[i].second],cl2);
      |           ^~~