oj.uz

Submission #826303

# Submission time Handle Problem Language Result Execution time Memory
826303 2023-08-15T12:31:19 Z ajay Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 83 ms 10820 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int n;
    std::cin >> n;
    vii a(n + 2);
    vi b(n + 1), ans(n + 2);
    vi pref(n + 1), suff(n + 1);
    rep(i, 1, n + 2)
    {
        cin >> a[i].first;
        a[i].y = i;
    }
    rep(i, 1, n + 1)
    {
        cin >> b[i];
    }
    sort(a.begin() + 1, a.begin() + n + 2);
    sort(b.begin() + 1, b.begin() + n + 1);

    rep(i, 1, n + 1)
    {
        pref[i] = max(pref[i - 1], max(a[i].first - b[i], 0));
    }
    rep(i, 1, n + 1)
    {
        suff[i] = max(suff[i - 1], max(a[n + 2 - i].first - b[n + 1 - i], 0));
    }

    rep(i, 1, n + 2)
    {
        ans[a[i].y] = max(pref[i - 1], suff[n + 1 - i]);
    }

    rep(i, 1, n + 2)
    {
        cout << ans[i] << ' ';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 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 1 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 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 340 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 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 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 1 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 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 340 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 340 KB Output is correct
33 Correct 68 ms 9884 KB Output is correct
34 Correct 83 ms 10340 KB Output is correct
35 Correct 68 ms 10080 KB Output is correct
36 Correct 68 ms 10528 KB Output is correct
37 Correct 71 ms 10820 KB Output is correct
38 Correct 70 ms 10684 KB Output is correct
39 Correct 69 ms 9676 KB Output is correct
40 Correct 69 ms 9744 KB Output is correct
41 Correct 71 ms 9912 KB Output is correct
42 Correct 69 ms 9804 KB Output is correct
43 Correct 70 ms 9656 KB Output is correct
44 Correct 79 ms 9284 KB Output is correct
45 Correct 67 ms 9440 KB Output is correct
46 Correct 69 ms 9364 KB Output is correct
47 Correct 64 ms 9372 KB Output is correct
48 Correct 77 ms 9380 KB Output is correct
49 Correct 71 ms 10052 KB Output is correct
50 Correct 71 ms 10052 KB Output is correct
51 Correct 70 ms 10004 KB Output is correct
52 Correct 71 ms 10052 KB Output is correct
53 Correct 71 ms 10048 KB Output is correct