oj.uz

답안 #239051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239051 2020-06-14T08:43:44 Z kartel Vrtić (COCI18_vrtic) C++14
32 / 160
 5 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int cur, bestfriend[N], surprize[N], i, l, r, n, ans[N];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> bestfriend[i];
    for (i = 1; i <= n; i++) cin >> surprize[i];

    sort(surprize + 1, surprize + 1 + n);

    l = 1;
    r = n;
    i = n;

    while (l <= r)
    {
        ans[r] = surprize[i];
        r--;
        i--;
        if (l > r) break;
        ans[l] = surprize[i];
        i--;
        l++;
    }

    cur = 0;

    for (i = 1; i <= n; i++) cur = max(cur, abs(ans[i] - ans[bestfriend[i]]));

    cout << cur << el;

    for (i = 1; i <= n; i++) cout << ans[i] << " ";
}

/*
8 8
...).).*
*....)..
.)*(..).
(*)((...
.)).)(..
.)(.)..(
...).(.*
M.......
*/
//
//110000
//1100

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB jury has better answer

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB jury has better answer

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB jury has better answer

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB jury has better answer
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB jury has better answer
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB jury has better answer
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB jury has better answer
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB jury has better answer
2 Halted 0 ms 0 KB -