oj.uz

답안 #1051423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051423 2024-08-10T06:30:38 Z manhlinh1501 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 65 ms 10836 KB 
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using i64 = long long;
const int MAXN = 2e5 + 5;

int N;
pii a[MAXN];
int b[MAXN];
int prefix[MAXN];
int suffix[MAXN];
int ans[MAXN];

signed main() {
#define TASK "code"

    if (fopen(TASK ".inp", "r")) {
        freopen(TASK ".inp", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N;
    for(int i = 1; i <= N + 1; i++) {
        cin >> a[i].first;
        a[i].second = 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 + 1; i++) cout << a[i].first << " ";
    for(int i = 1, j = 1; i <= N; i++) {
        int x = a[j].first - b[i];
        prefix[j] = max(prefix[j - 1], x);
        j++;
    }
    for(int i = N, j = N + 1; i >= 1; i--) {
        int x = a[j].first - b[i];
//        cout << a[j].first << " " << b[i] << "\n";
        suffix[j] = max(suffix[j + 1], x);
        j--;
    }
    for(int i = 1; i <= N + 1; i++)
        ans[a[i].second] = max(prefix[i - 1], suffix[i + 1]);
    for(int i = 1; i <= N + 1; i++) cout << ans[i] << " ";
}

Compilation message

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

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2536 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2552 KB Output is correct
28 Correct 1 ms 2548 KB Output is correct
29 Correct 1 ms 2548 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 51 ms 10068 KB Output is correct
34 Correct 53 ms 10544 KB Output is correct
35 Correct 54 ms 10140 KB Output is correct
36 Correct 51 ms 10580 KB Output is correct
37 Correct 55 ms 10836 KB Output is correct
38 Correct 52 ms 10836 KB Output is correct
39 Correct 52 ms 9920 KB Output is correct
40 Correct 51 ms 9896 KB Output is correct
41 Correct 52 ms 9808 KB Output is correct
42 Correct 51 ms 9788 KB Output is correct
43 Correct 52 ms 9808 KB Output is correct
44 Correct 50 ms 9556 KB Output is correct
45 Correct 59 ms 9552 KB Output is correct
46 Correct 55 ms 9552 KB Output is correct
47 Correct 47 ms 9548 KB Output is correct
48 Correct 51 ms 9544 KB Output is correct
49 Correct 65 ms 10116 KB Output is correct
50 Correct 54 ms 10060 KB Output is correct
51 Correct 60 ms 10100 KB Output is correct
52 Correct 52 ms 10068 KB Output is correct
53 Correct 57 ms 10100 KB Output is correct