oj.uz

Submission #991583

# Submission time Handle Problem Language Result Execution time Memory
991583 2024-06-02T14:10:56 Z rsinventor Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 68 ms 9312 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector <ll> vll;
typedef vector<bool> vb;
typedef vector <string> vs;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef vector <pii> vpii;

#define all(a) (a).begin(), (a).end()
#define pb push_back
#define endl "\n"

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vpii a(n+1);
    for(int i = 0; i < n+1; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    vi b(n);
    for(int i = 0; i < n; i++) {
        cin >> b[i];
    }

    sort(all(a));
    sort(all(b));
    vector<int> ans(n+1);
    int mx = 0;
    for(int i = 0; i < n; i++) {
        mx = max(mx, max(0, a[i].first-b[i]));
    }
    ans[a[a.size()-1].second] = mx;
    for(int i = n-1; i >=0; i--) {
        mx = max(mx, max(0, a[i+1].first-b[i]));
        ans[a[i].second] = mx;
    }
    for(int a: ans) {
        cout << a << " ";
    }
    cout << endl;

    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 408 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 408 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 408 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 59 ms 8532 KB Output is correct
34 Correct 62 ms 8788 KB Output is correct
35 Correct 67 ms 8480 KB Output is correct
36 Correct 65 ms 9044 KB Output is correct
37 Correct 64 ms 9312 KB Output is correct
38 Correct 63 ms 9300 KB Output is correct
39 Correct 67 ms 8276 KB Output is correct
40 Correct 61 ms 8272 KB Output is correct
41 Correct 67 ms 8588 KB Output is correct
42 Correct 68 ms 8316 KB Output is correct
43 Correct 62 ms 8276 KB Output is correct
44 Correct 63 ms 7764 KB Output is correct
45 Correct 59 ms 7856 KB Output is correct
46 Correct 59 ms 7764 KB Output is correct
47 Correct 56 ms 8024 KB Output is correct
48 Correct 56 ms 7996 KB Output is correct
49 Correct 63 ms 8480 KB Output is correct
50 Correct 63 ms 8532 KB Output is correct
51 Correct 63 ms 8532 KB Output is correct
52 Correct 67 ms 8532 KB Output is correct
53 Correct 62 ms 8528 KB Output is correct