oj.uz

Submission #314279

# Submission time Handle Problem Language Result Execution time Memory
314279 2020-10-19T11:05:12 Z aZvezda Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 105 ms 11768 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e12 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 2e5 + 10;
pair<ll, ll> a[MAX_N];
ll b[MAX_N];
ll pref[MAX_N], suf[MAX_N];
ll n;
ll ans[MAX_N];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n;
    for(ll i = 0; i < n + 1; i ++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    for(ll i = 0; i < n; i ++) {
        cin >> b[i];
    }
    sort(a, a + n + 1);
    sort(b, b + n);
    for(ll i = 0; i < n; i ++) {
        pref[i] = max(a[i].first - b[i], 0ll);
        if(i != 0) {
            chkmax(pref[i], pref[i - 1]);
        }
    }
    for(ll i = 0; i < n; i ++) {
        suf[n - i] = max(a[n - i].first - b[n - 1 - i], 0ll);
        chkmax(suf[n - i], suf[n - i + 1]);
    }
    for(ll i = 0; i < n + 1; i ++) {
        if(i != 0) {
            ans[a[i].second] = pref[i - 1];
        }
        chkmax(ans[a[i].second], suf[i + 1]);
    }
    for(ll i = 0; i < n + 1; i ++) {
        cout << ans[i] << " ";
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 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 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 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 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 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 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 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 98 ms 10872 KB Output is correct
34 Correct 103 ms 11256 KB Output is correct
35 Correct 100 ms 10872 KB Output is correct
36 Correct 100 ms 11344 KB Output is correct
37 Correct 105 ms 11768 KB Output is correct
38 Correct 105 ms 11640 KB Output is correct
39 Correct 101 ms 10716 KB Output is correct
40 Correct 100 ms 10616 KB Output is correct
41 Correct 101 ms 10684 KB Output is correct
42 Correct 100 ms 10616 KB Output is correct
43 Correct 99 ms 10620 KB Output is correct
44 Correct 98 ms 10232 KB Output is correct
45 Correct 98 ms 10232 KB Output is correct
46 Correct 102 ms 10360 KB Output is correct
47 Correct 97 ms 10232 KB Output is correct
48 Correct 94 ms 10232 KB Output is correct
49 Correct 104 ms 10852 KB Output is correct
50 Correct 104 ms 11000 KB Output is correct
51 Correct 103 ms 10872 KB Output is correct
52 Correct 104 ms 10872 KB Output is correct
53 Correct 103 ms 10932 KB Output is correct