oj.uz

답안 #310164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310164 2020-10-06T03:24:21 Z quocnguyen1012 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 221 ms 7544 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
const int N=2e5+5;
int n,b[N],can[N],ST[4*N],res[N];
pair<int,int>a[N];
 
int get(int id,int l,int r,int L,int R)
{
    if (r<L||R<l) return 0;
    if (L<=l&&r<=R) return ST[id];
    int mid=(l+r)/2;
    return max(get (id*2,l,mid,L,R),get(id*2+1,mid+1,r,L,R));
}
 
void update(int id,int l,int r,int u,int x)
{
    if(r==l&&l==u)
    {
        ST[id]=x;
        return;
    }
    if(u>r||u<l) return;
    int mid=(l+r)/2;
    update(id*2,l,mid,u,x);
    update(id*2+1,mid+1,r,u,x);
    ST[id]=max(ST[id*2],ST[id*2+1]);
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    for(int i=1;i<=n+1;i++)
    {
        cin>>a[i].first;
        a[i].second=i;
    }
    sort(a+1,a+n+2);
    for(int i=1;i<=n;i++) cin>>b[i];
    sort(b+1,b+n+1);
    for(int i=2;i<=n+1;i++) update(1,1,n,i-1,a[i].first-b[i-1]);
    for(int i=1;i<=n+1;i++)
    {
        res[a[i].second]=get(1,1,n,1,n);
        update(1,1,n,i,a[i].first-b[i]);
    }
    for(int i=1;i<=n+1;i++) cout<<res[i]<<' ';
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 416 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 416 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 199 ms 6904 KB Output is correct
34 Correct 221 ms 7160 KB Output is correct
35 Correct 196 ms 6904 KB Output is correct
36 Correct 201 ms 7416 KB Output is correct
37 Correct 210 ms 7544 KB Output is correct
38 Correct 203 ms 7416 KB Output is correct
39 Correct 199 ms 6616 KB Output is correct
40 Correct 206 ms 6648 KB Output is correct
41 Correct 198 ms 6780 KB Output is correct
42 Correct 201 ms 6648 KB Output is correct
43 Correct 208 ms 6652 KB Output is correct
44 Correct 198 ms 6324 KB Output is correct
45 Correct 201 ms 6264 KB Output is correct
46 Correct 204 ms 6392 KB Output is correct
47 Correct 196 ms 6136 KB Output is correct
48 Correct 192 ms 6264 KB Output is correct
49 Correct 205 ms 6776 KB Output is correct
50 Correct 207 ms 6776 KB Output is correct
51 Correct 205 ms 6776 KB Output is correct
52 Correct 204 ms 6776 KB Output is correct
53 Correct 206 ms 6776 KB Output is correct