oj.uz

답안 #201407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201407 2020-02-10T12:41:15 Z karma Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 120 ms 6192 KB 
#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = int(2e5) + 5;

typedef pair<int, int> pii;
int ans[N], b[N], n, suf[N], cur;
pii a[N];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n; ++n;
    for(int i = 1; i <= n; ++i) cin >> a[i].fi, a[i].se = i;
    for(int i = 1; i < n; ++i) cin >> b[i];
    sort(a + 1, a + n + 1); sort(b + 1, b + n);
    for(int i = n, j = n - 1; i > 1; --i, --j) {
        suf[i] = max(suf[i + 1], max(a[i].fi - b[j], 0));
    }
    cur = 0;
    for(int i = 1; i <= n; ++i) {
        ans[a[i].se] = max(cur, suf[i + 1]);
        cur = max(cur, max(a[i].fi - b[i], 0));
    }
    for(int i = 1; i <= n; ++i) cout << ans[i] << ' ';
}

Compilation message

ho_t1.cpp: In function 'int32_t main()':
ho_t1.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 252 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 380 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 120 ms 5728 KB Output is correct
34 Correct 115 ms 5880 KB Output is correct
35 Correct 115 ms 5624 KB Output is correct
36 Correct 116 ms 6008 KB Output is correct
37 Correct 118 ms 6192 KB Output is correct
38 Correct 118 ms 6136 KB Output is correct
39 Correct 111 ms 5368 KB Output is correct
40 Correct 112 ms 5240 KB Output is correct
41 Correct 116 ms 5496 KB Output is correct
42 Correct 114 ms 5368 KB Output is correct
43 Correct 117 ms 5392 KB Output is correct
44 Correct 119 ms 4984 KB Output is correct
45 Correct 110 ms 5112 KB Output is correct
46 Correct 112 ms 4984 KB Output is correct
47 Correct 108 ms 4856 KB Output is correct
48 Correct 104 ms 4856 KB Output is correct
49 Correct 115 ms 5496 KB Output is correct
50 Correct 115 ms 5496 KB Output is correct
51 Correct 117 ms 5496 KB Output is correct
52 Correct 114 ms 5368 KB Output is correct
53 Correct 120 ms 5368 KB Output is correct