oj.uz

답안 #1097077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097077 2024-10-06T03:16:15 Z TrinhKhanhDung Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 76 ms 10952 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e5 + 10;

int N;
int b[MAX];
int prefix[MAX], suffix[MAX], ans[MAX];
pair<int, int> a[MAX];

void solve(){
    cin >> N;
    for(int i = 1; i <= N + 1; i++){
        cin >> a[i].fi;
        a[i].se = i;
    }
    for(int i = 1; i <= N; i++) cin >> b[i];

    sort(a + 1, a + N + 2);
    sort(b + 1, b + N + 1);

    for(int i = 1; i <= N; i++){
        prefix[i] = max(prefix[i - 1], max(0, a[i].fi - b[i]));
    }

    for(int i = N; i >= 1; i--){
        suffix[i] = max(suffix[i + 1] , max(0, a[i + 1].fi - b[i]));
    }

    for(int i = 1; i <= N + 1; i++){
        ans[a[i].se] = max(prefix[i - 1], suffix[i]);
    }

    for(int i = 1; i <= N + 1; i++) cout << ans[i] << ' ';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("task.inp","r",stdin);
//    freopen("task.out","w",stdout);

    int T = 1;
//    cin >> T;
    for(; T; T--) solve();

    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 344 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 344 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 344 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 524 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 516 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 344 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 524 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 516 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 60 ms 10132 KB Output is correct
34 Correct 74 ms 10320 KB Output is correct
35 Correct 63 ms 10068 KB Output is correct
36 Correct 62 ms 10556 KB Output is correct
37 Correct 63 ms 10952 KB Output is correct
38 Correct 68 ms 10832 KB Output is correct
39 Correct 61 ms 9712 KB Output is correct
40 Correct 61 ms 9804 KB Output is correct
41 Correct 64 ms 9812 KB Output is correct
42 Correct 61 ms 9812 KB Output is correct
43 Correct 61 ms 9856 KB Output is correct
44 Correct 59 ms 9392 KB Output is correct
45 Correct 65 ms 9524 KB Output is correct
46 Correct 76 ms 9392 KB Output is correct
47 Correct 56 ms 9552 KB Output is correct
48 Correct 56 ms 9540 KB Output is correct
49 Correct 65 ms 10000 KB Output is correct
50 Correct 75 ms 9996 KB Output is correct
51 Correct 63 ms 10128 KB Output is correct
52 Correct 63 ms 9944 KB Output is correct
53 Correct 63 ms 10064 KB Output is correct