oj.uz

Submission #566957

# Submission time Handle Problem Language Result Execution time Memory
566957 2022-05-23T06:51:20 Z Rifal Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 277 ms 10012 KB 
#include <bits/stdc++.h>
#include <fstream>
#define endl '\n'
#define mod 32768
#define INF 100000000000000
//#define ll long long
//#define cin fin
//#define cout fout
using namespace std;
//ofstream fout("convention.out");
//ifstream fin("convention.in");

int main()
{
    int n;
    cin >> n;
    long long mx = 0;
    pair<long long, int> a[n+1];
    long long b[n], ans[n+1], cur[n];
    for(int i = 0; i < n+1; 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);
    for(int i = n-1; i >= 0; i--)
    {
        cur[i] = max(a[i].first-b[i],0ll);
        mx = max(mx,cur[i]);
    }
    ans[a[n].second] = mx;
    for(int i = n-1; i >= 0; i--)
    {
        cur[i] = max(a[i+1].first-b[i],0ll);
        mx = max(mx,cur[i]);
        ans[a[i].second] = mx;
    }
    for(int 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 212 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 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 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 3 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 212 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 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 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 198 ms 9132 KB Output is correct
34 Correct 210 ms 9552 KB Output is correct
35 Correct 211 ms 9280 KB Output is correct
36 Correct 204 ms 9676 KB Output is correct
37 Correct 195 ms 10012 KB Output is correct
38 Correct 215 ms 9908 KB Output is correct
39 Correct 193 ms 9032 KB Output is correct
40 Correct 194 ms 8872 KB Output is correct
41 Correct 232 ms 9080 KB Output is correct
42 Correct 232 ms 8944 KB Output is correct
43 Correct 217 ms 8880 KB Output is correct
44 Correct 238 ms 8524 KB Output is correct
45 Correct 211 ms 8580 KB Output is correct
46 Correct 211 ms 8620 KB Output is correct
47 Correct 221 ms 8628 KB Output is correct
48 Correct 254 ms 8612 KB Output is correct
49 Correct 241 ms 9164 KB Output is correct
50 Correct 245 ms 9252 KB Output is correct
51 Correct 217 ms 9252 KB Output is correct
52 Correct 277 ms 9248 KB Output is correct
53 Correct 218 ms 9248 KB Output is correct