oj.uz

Submission #235063

# Submission time Handle Problem Language Result Execution time Memory
235063 2020-05-26T21:40:22 Z AmineWeslati Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 349 ms 24932 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};

int32_t main(){
   boost;
   int N; cin>>N;
   vpi vec; vi v;
   vi res(N+1);

   for(int i=0; i<=N; i++){
      int x; cin>>x;
      vec.pb({x,i});
   }
   sort(all(vec));
   /*for(auto x: vec) cout << x.fi << ' ' << x.se << endl;
   cout << endl;*/

   for(int i=0; i<N; i++){
      int x; cin>>x;
      v.pb(x);
   }
   sort(all(v));
   //for(auto x: v) cout << x << endl;

   set<pair<int,pi>> s;
   for(int i=0; i<N; i++){
      s.insert({max((ll)0,vec[i].fi-v[i]),{i,i}});
   }
   
   /*for(auto x: s) cout << x.fi << ' '<<x.se.fi << ' '<<x.se.se << endl;
   cout << endl;*/
   
   auto it=s.end(); it--;
   res[vec[N].se]=(*it).fi;
   
   //cout << res[vec[N].se] << endl;

   for(int i=N-1; i>=0; i--){
      s.erase({max((ll)0,vec[i].fi-v[i]),{i,i}});
      s.insert({max((ll)0,vec[i+1].fi-v[i]),{i+1,i}});
      it=s.end(); it--;
      res[vec[i].se]=(*it).fi;
   }

   for(auto x: res) cout << x << ' ';
   cout << endl;


   return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 6 ms 640 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 268 ms 23524 KB Output is correct
34 Correct 278 ms 24544 KB Output is correct
35 Correct 238 ms 23592 KB Output is correct
36 Correct 267 ms 24164 KB Output is correct
37 Correct 294 ms 24932 KB Output is correct
38 Correct 254 ms 24680 KB Output is correct
39 Correct 316 ms 23524 KB Output is correct
40 Correct 330 ms 23524 KB Output is correct
41 Correct 307 ms 23652 KB Output is correct
42 Correct 323 ms 23796 KB Output is correct
43 Correct 306 ms 23524 KB Output is correct
44 Correct 221 ms 22884 KB Output is correct
45 Correct 220 ms 23140 KB Output is correct
46 Correct 225 ms 22884 KB Output is correct
47 Correct 216 ms 23652 KB Output is correct
48 Correct 216 ms 23656 KB Output is correct
49 Correct 349 ms 24256 KB Output is correct
50 Correct 325 ms 24164 KB Output is correct
51 Correct 326 ms 24292 KB Output is correct
52 Correct 318 ms 24308 KB Output is correct
53 Correct 322 ms 24292 KB Output is correct