oj.uz

Submission #704723

# Submission time Handle Problem Language Result Execution time Memory
704723 2023-03-02T19:02:46 Z epicci23 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 92 ms 16976 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}




void solve()
{
  int n=in();
  int suf[n+2],pre[n+2];
  vector<pii> ar1(n+1),ar2(n);
  for(int i=0;i<n+1;i++) ar1[i]={in(),i};
  for(int i=0;i<n;i++) ar2[i]={in(),i};

  sort(all(ar1));sort(all(ar2));
  pre[1]=max(ar1[0].ff-ar2[0].ff,0LL);
  for(int i=2;i<=n;i++) pre[i]=max(pre[i-1],max(0LL,ar1[i-1].ff-ar2[i-1].ff));
  suf[n+1]=max(ar1[n].ff-ar2[n-1].ff,0LL);
  for(int i=n;i>=2;i--) suf[i]=max(suf[i+1],max(ar1[i-1].ff-ar2[i-2].ff,0LL));

  int ans[n+2];
  ans[ar1[0].ss]=suf[2];
  ans[ar1[n].ss]=pre[n];
  for(int i=2;i<=n;i++) ans[ar1[i-1].ss]=max(pre[i-1],suf[i+1]);

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

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

ho_t1.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 436 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 420 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 448 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 436 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 420 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Correct 86 ms 15908 KB Output is correct
34 Correct 86 ms 16544 KB Output is correct
35 Correct 83 ms 15980 KB Output is correct
36 Correct 84 ms 16556 KB Output is correct
37 Correct 92 ms 16976 KB Output is correct
38 Correct 88 ms 16832 KB Output is correct
39 Correct 84 ms 15844 KB Output is correct
40 Correct 82 ms 15740 KB Output is correct
41 Correct 86 ms 15948 KB Output is correct
42 Correct 84 ms 15820 KB Output is correct
43 Correct 81 ms 15724 KB Output is correct
44 Correct 79 ms 15232 KB Output is correct
45 Correct 84 ms 15340 KB Output is correct
46 Correct 80 ms 15260 KB Output is correct
47 Correct 85 ms 15716 KB Output is correct
48 Correct 89 ms 15724 KB Output is correct
49 Correct 88 ms 16204 KB Output is correct
50 Correct 86 ms 16204 KB Output is correct
51 Correct 87 ms 16260 KB Output is correct
52 Correct 85 ms 16216 KB Output is correct
53 Correct 84 ms 16220 KB Output is correct