oj.uz

Submission #292904

# Submission time Handle Problem Language Result Execution time Memory
292904 2020-09-07T14:42:25 Z Hehehe Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 117 ms 15608 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e5 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, b[N], s[N], ans[N], l[N], r[N];
pi a[N];

void solve(){

    cin >> n;

    for(int i = 1; i <= n + 1; i++){
        cin >> a[i].ff;
        a[i].ss = i;
    }

    sort(a + 1, a + n + 2);

    for(int i = 1; i <= n; i++){
        cin >> b[i];
    }

    sort(b+ 1, b + n + 1);

    for(int i = 1; i <= n; i++){
        l[i + 1] = max(l[i], a[i].ff - b[i]);
    }

    for(int i = n; i > 0; i--){
        r[i] = max(r[i + 1], a[i + 1].ff - b[i]);
    }

    for(int i = 1; i <= n + 1; i++){
        ans[a[i].ss] += max(l[i], r[i]);
    }

    for(int i = 1; i <= n + 1; i++){
        cout << max(0ll, ans[i]) << ' ';
    }cout << '\n';

}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 101 ms 14456 KB Output is correct
34 Correct 109 ms 15096 KB Output is correct
35 Correct 101 ms 14584 KB Output is correct
36 Correct 104 ms 15096 KB Output is correct
37 Correct 108 ms 15608 KB Output is correct
38 Correct 106 ms 15352 KB Output is correct
39 Correct 102 ms 14456 KB Output is correct
40 Correct 106 ms 14328 KB Output is correct
41 Correct 104 ms 14480 KB Output is correct
42 Correct 103 ms 14456 KB Output is correct
43 Correct 117 ms 14332 KB Output is correct
44 Correct 113 ms 13944 KB Output is correct
45 Correct 104 ms 14076 KB Output is correct
46 Correct 100 ms 13944 KB Output is correct
47 Correct 98 ms 14200 KB Output is correct
48 Correct 95 ms 14200 KB Output is correct
49 Correct 116 ms 14840 KB Output is correct
50 Correct 113 ms 14840 KB Output is correct
51 Correct 105 ms 14840 KB Output is correct
52 Correct 106 ms 14840 KB Output is correct
53 Correct 106 ms 14840 KB Output is correct