oj.uz

답안 #567033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567033 2022-05-23T07:25:45 Z Uzouf Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 144 ms 11848 KB 
#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;
    }
    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++) {
      int cl1=0;
      if (i>0) cl1=prfx[i-1];
      int cl2=0;
      if (i<n) cl2=sfx[i+1];
      ans[a[i].second]=max(cl1,cl2);
    }

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

}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 372 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 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 372 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 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 99 ms 10720 KB Output is correct
34 Correct 119 ms 11368 KB Output is correct
35 Correct 100 ms 11096 KB Output is correct
36 Correct 101 ms 11464 KB Output is correct
37 Correct 99 ms 11848 KB Output is correct
38 Correct 138 ms 11688 KB Output is correct
39 Correct 98 ms 10756 KB Output is correct
40 Correct 97 ms 10728 KB Output is correct
41 Correct 129 ms 10844 KB Output is correct
42 Correct 103 ms 10860 KB Output is correct
43 Correct 101 ms 10760 KB Output is correct
44 Correct 114 ms 10356 KB Output is correct
45 Correct 119 ms 10404 KB Output is correct
46 Correct 143 ms 10396 KB Output is correct
47 Correct 102 ms 10500 KB Output is correct
48 Correct 100 ms 10400 KB Output is correct
49 Correct 114 ms 11040 KB Output is correct
50 Correct 109 ms 11036 KB Output is correct
51 Correct 144 ms 11008 KB Output is correct
52 Correct 100 ms 11020 KB Output is correct
53 Correct 95 ms 11072 KB Output is correct