Submission #1270892

#	Time	Username	Problem	Language	Result	Execution time	Memory
1270892		sasde	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	119 ms	11668 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};

struct segmax {
    int n;
    vector<int> st, lazy;
    segmax() {};
    segmax(int _n): n(_n), st(n * 4 + 5, 0), lazy(n * 4 + 5, 0) {};


    void down(int id) {
        if (lazy[id] == 0) return;
        lazy[id << 1] = lazy[id];
        lazy[id << 1 | 1] = lazy[id];
        st[id << 1] = lazy[id];
        st[id << 1 | 1] = lazy[id];
        lazy[id] = 0;
    }

    void update(int id, int l, int r, int u, int v, int val) {
        if (r < u || l > v) return;
        if (l >= u && r <= v) {
            st[id] = val;
            lazy[id] = val;
            return;
        }
        down(id);
        int mid = (l + r) >> 1;
        update(id << 1, l, mid, u, v, val);
        update(id << 1 | 1, mid + 1, r, u, v, val);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }

    int get(int id, int l, int r, int u, int v) {
        if (r < u || l > v) return -1e9;
        if (l >= u && r <= v) return st[id];
        down(id);
        int mid = (l + r) >> 1;
        return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
    }
};
int node,b[N],ans[N];
ii a[N];
bool M2;
void solve(){
	cin >> node;
	for(int i=1;i<=node+1;++i)cin >> a[i].fi,a[i].se=i;;
	for(int j=1;j<=node;++j)cin >> b[j];
	sort(a+1,a+2+node);
	sort(b+1,b+1+node);
	segmax seg(node);
	for(int i=1;i<=node;++i){
		seg.update(1,1,node,i,i,a[i+1].fi-b[i]);
	}
	ans[a[1].se]=max(0,seg.st[1]);
	// cout <<max(0,seg.st[1]);
	for(int i=2;i<=node+1;++i){
		seg.update(1,1,node,i-1,i-1,a[i-1].fi-b[i-1]);
		ans[a[i].se]=max(0,seg.st[1]);
		// cout <<" "<<max(0,seg.st[1]);
	}

	for(int i=1;i<=node+1;++i)cout << ans[i]<<" ";
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	    #define task "aws"
	    if(fopen(task".inp","r")){
	      freopen(task".inp","r",stdin);
	      freopen(task".out","w",stdout);
	    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();cout<<'\n';
}
look_memory;
look_time;
}

Compilation message (stderr)

ho_t1.cpp:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main()
      | ^~~~
ho_t1.cpp: In function 'int main()':
ho_t1.cpp:101:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |               freopen(task".inp","r",stdin);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:102:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |               freopen(task".out","w",stdout);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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