oj.uz

Submission #717692

# Submission time Handle Problem Language Result Execution time Memory
717692 2023-04-02T10:51:41 Z fdnfksd Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 108 ms 15560 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=3e5;
const ll inf=1e18;
const ll mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
#define rand rd
ll ans[maxN];
struct qq
{
    ll x,id;
    bool operator<(const qq&o)
    {
        return x<o.x;
    }
}a[maxN];
ll b[maxN],suff[maxN],pre[maxN];
ll n;
void solve()
{
    cin >> n;
    for(int i=1;i<=n+1;i++) cin >> a[i].x,a[i].id=i;
    for(int i=1;i<=n;i++) cin >> b[i];
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    suff[n+1]=0;
    for(int i=n;i>=1;i--)
    {
        suff[i]=max(suff[i+1],a[i+1].x-b[i]);
    }
    pre[0]=0;
    for(int i=1;i<=n;i++)
    {
        pre[i]=max(pre[i-1],a[i].x-b[i]);
    }
    for(int i=1;i<=n+1;i++)
    {
        ans[a[i].id]=max(suff[i],pre[i-1]);
    }
    for(int i=1;i<=n+1;i++)
    {
        cout << ans[i]<<' ';
    }
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 388 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 388 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 89 ms 14412 KB Output is correct
34 Correct 98 ms 14976 KB Output is correct
35 Correct 81 ms 14504 KB Output is correct
36 Correct 88 ms 15072 KB Output is correct
37 Correct 93 ms 15560 KB Output is correct
38 Correct 88 ms 15304 KB Output is correct
39 Correct 84 ms 14296 KB Output is correct
40 Correct 88 ms 14288 KB Output is correct
41 Correct 87 ms 14400 KB Output is correct
42 Correct 82 ms 14408 KB Output is correct
43 Correct 85 ms 14224 KB Output is correct
44 Correct 81 ms 13772 KB Output is correct
45 Correct 81 ms 13900 KB Output is correct
46 Correct 79 ms 13960 KB Output is correct
47 Correct 67 ms 14140 KB Output is correct
48 Correct 98 ms 14108 KB Output is correct
49 Correct 108 ms 14668 KB Output is correct
50 Correct 88 ms 14724 KB Output is correct
51 Correct 94 ms 14748 KB Output is correct
52 Correct 93 ms 14668 KB Output is correct
53 Correct 87 ms 14708 KB Output is correct