oj.uz

답안 #1083335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083335 2024-09-03T02:19:46 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 167 ms 19384 KB 
#include <bits/stdc++.h>
//#ifndef ONLINE_JUDGE
//#include <debugging.h>
//#endif
#define ff first
#define ss second
#define pp push_back
#define all(x) (x).begin(),(x).end()
#define dbg(v)  cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int,int>;
using pll = pair <ll,ll>;
using pld = pair <ld,ld>;
const char el ='\n';
const char sp = ' ';
const int maxn = 2e5+5, mod = 1e9+7, N = 10;
const ll inf = 1e18L+3;
int n,a[maxn],b[maxn],c[maxn],l[maxn],r[maxn];
map <int,int> ans;
void input()
{
    cin>>n;
    for(int i=1;i<=n+1;++i) cin>>a[i];
    for(int i=1;i<=n+1;++i) c[i]=a[i];
    for(int i=1;i<=n;++i) cin>>b[i];
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
}

void solve()
{
    for(int i=1;i<=n;++i)       l[i] = max(l[i-1],a[i]-b[i]);
    for(int i=n+1;i>1;--i)      r[i] = max(r[i+1],a[i]-b[i-1]);
    for(int i=1;i<=n+1;++i)     ans[a[i]] = max(l[i-1],r[i+1]);
    for(int i=1;i<=n+1;++i)     cout<<ans[c[i]]<<sp;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
//    cin>>test;
    while(test-->0)
    {
        input();
        solve();
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 532 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 1 ms 480 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 604 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 532 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 1 ms 480 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 153 ms 18096 KB Output is correct
34 Correct 156 ms 19028 KB Output is correct
35 Correct 142 ms 18516 KB Output is correct
36 Correct 156 ms 19180 KB Output is correct
37 Correct 167 ms 19384 KB Output is correct
38 Correct 152 ms 19104 KB Output is correct
39 Correct 144 ms 18256 KB Output is correct
40 Correct 139 ms 17992 KB Output is correct
41 Correct 165 ms 18388 KB Output is correct
42 Correct 152 ms 18260 KB Output is correct
43 Correct 157 ms 18000 KB Output is correct
44 Correct 149 ms 17636 KB Output is correct
45 Correct 139 ms 17708 KB Output is correct
46 Correct 138 ms 17492 KB Output is correct
47 Correct 88 ms 10508 KB Output is correct
48 Correct 92 ms 10576 KB Output is correct
49 Correct 165 ms 18768 KB Output is correct
50 Correct 146 ms 18672 KB Output is correct
51 Correct 155 ms 18768 KB Output is correct
52 Correct 151 ms 18768 KB Output is correct
53 Correct 148 ms 18772 KB Output is correct