oj.uz

Submission #203641

# Submission time Handle Problem Language Result Execution time Memory
203641 2020-02-21T17:46:43 Z osaaateiasavtnl Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 141 ms 11768 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 2e5 + 7;
ii a[N];
int b[N], mem[N], pref[N], post[N];
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    for (int i = 0; i < n + 1; ++i) {
        cin >> a[i].f;
        a[i].s = i;
    }
    for (int i = 0; i < n; ++i) 
        cin >> b[i];
 
    sort(a, a + n + 1);
    sort(b, b + n);
 
    for (int i = 0; i < n; ++i)
        pref[i + 1] = max(pref[i], a[i].f - b[i]);
    for (int i = n - 1; i >= 0; --i)
        post[i] = max(post[i + 1], a[i + 1].f - b[i]);
 
    for (int i = 0; i < n + 1; ++i) 
        mem[a[i].s] = max(pref[i], post[i]);
     
    for (int i = 0; i <= n; ++i)
        cout << mem[i] << ' ';
    cout << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 388 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 388 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 408 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 8 ms 504 KB Output is correct
22 Correct 6 ms 504 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 6 ms 504 KB Output is correct
28 Correct 6 ms 504 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 5 ms 504 KB Output is correct
33 Correct 116 ms 10872 KB Output is correct
34 Correct 120 ms 11384 KB Output is correct
35 Correct 117 ms 10872 KB Output is correct
36 Correct 116 ms 11384 KB Output is correct
37 Correct 120 ms 11768 KB Output is correct
38 Correct 115 ms 11640 KB Output is correct
39 Correct 115 ms 10616 KB Output is correct
40 Correct 118 ms 10616 KB Output is correct
41 Correct 117 ms 10744 KB Output is correct
42 Correct 115 ms 10620 KB Output is correct
43 Correct 114 ms 10616 KB Output is correct
44 Correct 114 ms 10316 KB Output is correct
45 Correct 112 ms 10232 KB Output is correct
46 Correct 111 ms 10232 KB Output is correct
47 Correct 112 ms 10232 KB Output is correct
48 Correct 111 ms 10232 KB Output is correct
49 Correct 120 ms 11000 KB Output is correct
50 Correct 141 ms 11000 KB Output is correct
51 Correct 122 ms 11000 KB Output is correct
52 Correct 118 ms 10872 KB Output is correct
53 Correct 115 ms 10872 KB Output is correct