oj.uz

답안 #297797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297797 2020-09-12T00:56:19 Z balbit Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 110 ms 9336 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define pb push_back
#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(), (x).end()
#define MX(a,b) a=max(a,b)
#ifdef BALBIT
#define bug(...) cerr<<"#"<<#__VA_ARGS__<<": ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y){cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif // BALBIT

const int maxn = 3e5+5;

signed main(){
    IOS();
    bug(1,2);
    int n; cin>>n;
    vector<pii> a(n+1);
    vector<int> r(n+1);
    vector<int> b(n);
    for (int i = 0; i<n+1; ++i) cin>>a[i].f, a[i].s = i;
    sort(ALL(a));
    for (int i = 0; i<n; ++i) cin>>b[i];
    sort(ALL(b));
    int ts = 0;
    for (int i = 0; i<n; ++i) {
        MX(ts , max(a[i].f-b[i],0));
        MX(r[a[i+1].s] , ts);
        bug(ts);
    }

    ts = 0;
    for (int i = n; i>0; --i) {
        MX(ts , max(a[i].f-b[i-1],0));
        MX(r[a[i-1].s] , ts);
        bug(ts);
    }

    for (int i = 0; i<=n; ++i) {
        cout<<r[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 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 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 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 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 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 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 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 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 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 100 ms 8696 KB Output is correct
34 Correct 104 ms 8824 KB Output is correct
35 Correct 104 ms 8568 KB Output is correct
36 Correct 104 ms 9080 KB Output is correct
37 Correct 108 ms 9336 KB Output is correct
38 Correct 103 ms 9208 KB Output is correct
39 Correct 99 ms 8312 KB Output is correct
40 Correct 102 ms 8356 KB Output is correct
41 Correct 103 ms 8312 KB Output is correct
42 Correct 101 ms 8312 KB Output is correct
43 Correct 98 ms 8312 KB Output is correct
44 Correct 100 ms 7968 KB Output is correct
45 Correct 98 ms 8056 KB Output is correct
46 Correct 98 ms 7928 KB Output is correct
47 Correct 93 ms 7928 KB Output is correct
48 Correct 94 ms 7928 KB Output is correct
49 Correct 106 ms 8632 KB Output is correct
50 Correct 103 ms 8512 KB Output is correct
51 Correct 110 ms 8696 KB Output is correct
52 Correct 104 ms 8568 KB Output is correct
53 Correct 107 ms 8512 KB Output is correct