oj.uz

Submission #915404

# Submission time Handle Problem Language Result Execution time Memory
915404 2024-01-23T19:59:12 Z HorizonWest Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 327 ms 24856 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n; cin >> n; 
    vector <int> a(n+1), b(n), c; 
    for(auto& u : a) cin >> u;
    for(auto& u : b) cin >> u;

    c = a; sort(all(a)); sort(all(b));

    vector <int> s(n+1);
    for(int i = n; i > 0; i--)
        s[i-1] = max(s[i], a[i] - b[i-1]);

    int mx = 0; map <int, int> mp;

    for(int i = 0; i <= n; i++)
    {
        mp[a[i]] = max(mx, s[i]); 
        mx = max(mx, a[i] - b[i]);
    }

    for(auto& u : c) cout << mp[u] << " ";
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 524 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 508 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 524 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 170 ms 23492 KB Output is correct
34 Correct 174 ms 24524 KB Output is correct
35 Correct 177 ms 23668 KB Output is correct
36 Correct 166 ms 24052 KB Output is correct
37 Correct 161 ms 24856 KB Output is correct
38 Correct 203 ms 24664 KB Output is correct
39 Correct 192 ms 23576 KB Output is correct
40 Correct 208 ms 23376 KB Output is correct
41 Correct 165 ms 23680 KB Output is correct
42 Correct 274 ms 23632 KB Output is correct
43 Correct 167 ms 23380 KB Output is correct
44 Correct 203 ms 22868 KB Output is correct
45 Correct 244 ms 23360 KB Output is correct
46 Correct 194 ms 22760 KB Output is correct
47 Correct 104 ms 13652 KB Output is correct
48 Correct 109 ms 13544 KB Output is correct
49 Correct 237 ms 24168 KB Output is correct
50 Correct 184 ms 24180 KB Output is correct
51 Correct 327 ms 24164 KB Output is correct
52 Correct 274 ms 24092 KB Output is correct
53 Correct 247 ms 24124 KB Output is correct