oj.uz

답안 #762930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762930 2023-06-22T01:29:04 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
1 / 100
 1 ms 596 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
vector<pair<int, long long>> a;
vector<long long> b, prefLeft, prefRight, results;

int main()
{
    // freopen("inp.txt", "r", stdin);

    ios::sync_with_stdio(false);

    cin >> n;
    a.resize(n + 3); b.resize(n + 3);
    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.begin() + 1, a.begin() + n + 2);
    sort(b.begin() + 1, b.begin() + n + 1);

    prefLeft.resize(n + 3);
    for (int i = 1; i <= n; i++)
        prefLeft[i] = max(prefLeft[i - 1], max(a[i].first - b[i], 0ll));

    prefRight.resize(n + 3);
    for (int i = n + 1; i >= 2; i--)
        prefRight[i] = max(prefRight[i + 1], max(a[i].first - b[i - 1], 0ll));

    /*
    for (int i = 1; i <= n + 1; i++)
        cout << prefLeft[i] << ' ';
    cout << endl;
    for (int i = 1; i <= n + 1; i++)
        cout << prefRight[i] << ' ';
    cout << endl;
     */

    results.resize(n + 1);
    for (int i = 1; i <= n + 1; i++)
        results[a[i].second] = max(prefLeft[i - 1], prefRight[i + 1]);

    for (int i = 1; i <= n + 1; i++)
        cout << results[i] << ' ';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Runtime error 1 ms 596 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Runtime error 1 ms 596 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -