oj.uz

Submission #435168

# Submission time Handle Problem Language Result Execution time Memory
435168 2021-06-23T04:43:31 Z ak2006 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 247 ms 23256 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
    fast;
}
int main()
{
    setIO();
    int n;
    cin>>n;
    vvl a(n + 2,vl(2));
    vl b(n + 1);
    vl out(n + 2);
    vl pref(n + 1),suf(n + 3);
    for (int i = 1;i<=n + 1;i++)cin>>a[i][0],a[i][1] = i;
    for (int i = 1;i<=n;i++)cin>>b[i];
    sort(a.begin() + 1,a.end());
    sort(b.begin() + 1,b.end());
    
    for (int i = 1;i<=n;i++)
        pref[i] = max(pref[i - 1],a[i][0] - b[i]);
    
    for (int i = n;i>=1;i--)
        suf[i] = max(suf[i + 1],a[i + 1][0] - b[i]);
    for (int i = 1;i<=n + 1;i++){
        int pos = a[i][1];
        ll cur = max(pref[i - 1],suf[i]);
        out[pos] = cur;
    }
    for (int i = 1;i<=n + 1;i++)cout<<out[i]<<" ";
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 448 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 448 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 3 ms 592 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 516 KB Output is correct
33 Correct 200 ms 21800 KB Output is correct
34 Correct 201 ms 22872 KB Output is correct
35 Correct 220 ms 22076 KB Output is correct
36 Correct 189 ms 22580 KB Output is correct
37 Correct 208 ms 23256 KB Output is correct
38 Correct 192 ms 23000 KB Output is correct
39 Correct 247 ms 21900 KB Output is correct
40 Correct 179 ms 21840 KB Output is correct
41 Correct 190 ms 22084 KB Output is correct
42 Correct 211 ms 22056 KB Output is correct
43 Correct 186 ms 21828 KB Output is correct
44 Correct 209 ms 21308 KB Output is correct
45 Correct 176 ms 21428 KB Output is correct
46 Correct 181 ms 21168 KB Output is correct
47 Correct 197 ms 21876 KB Output is correct
48 Correct 158 ms 21992 KB Output is correct
49 Correct 213 ms 22648 KB Output is correct
50 Correct 180 ms 22516 KB Output is correct
51 Correct 182 ms 22584 KB Output is correct
52 Correct 193 ms 22516 KB Output is correct
53 Correct 225 ms 22468 KB Output is correct