oj.uz

Submission #239030

# Submission time Handle Problem Language Result Execution time Memory
239030 2020-06-14T07:29:48 Z VEGAnn Vrtić (COCI18_vrtic) C++14
0 / 160
 5 ms 384 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define i2 array<int,2>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 210;
const ll OO = 1e18;
const int md = int(1e9) + 7;
int n, nt[N], ans[N], a[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> nt[i];

    for (int i = 1; i <= n; i++)
        cin >> a[i];

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

    for (int it = 0, loc = 1; it < n; it++){
        ans[loc] = a[1 + it];
        loc = nt[loc];
    }

    cout << (a[n] - a[1]) * 2 << '\n';

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

    return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB the dissatisfaction value doesn't match with your answer

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB the dissatisfaction value doesn't match with your answer

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB no bag with given amount of candy
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB no bag with given amount of candy
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB no bag with given amount of candy
2 Halted 0 ms 0 KB -