oj.uz

Submission #334303

# Submission time Handle Problem Language Result Execution time Memory
334303 2020-12-09T01:22:51 Z limabeans Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 110 ms 10092 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;




int n;
pair<int,int> a[maxn];
int b[maxn];

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

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

    for (int i=0; i<n; i++) {
	cin>>b[i];
    }

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

    vector<int> ans(n+1);
    
    vector<int> suf(n+2,0);
    for (int i=n; i>0; i--) {
	suf[i] = max(suf[i+1], max(0, a[i].first-b[i-1]));
    }

    int pre = 0;
    for (int i=0; i<n+1; i++) {
	int skipi = a[i].second;
	int cur = max(pre, suf[i+1]);
	ans[skipi] = cur;
	pre = max(pre, max(0, a[i].first-b[i]));
    }

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


    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 99 ms 5788 KB Output is correct
34 Correct 102 ms 9708 KB Output is correct
35 Correct 99 ms 9324 KB Output is correct
36 Correct 104 ms 10092 KB Output is correct
37 Correct 103 ms 10092 KB Output is correct
38 Correct 102 ms 9964 KB Output is correct
39 Correct 101 ms 9296 KB Output is correct
40 Correct 100 ms 9068 KB Output is correct
41 Correct 100 ms 9328 KB Output is correct
42 Correct 105 ms 9196 KB Output is correct
43 Correct 98 ms 9068 KB Output is correct
44 Correct 96 ms 8684 KB Output is correct
45 Correct 98 ms 8812 KB Output is correct
46 Correct 97 ms 8684 KB Output is correct
47 Correct 94 ms 8812 KB Output is correct
48 Correct 93 ms 8684 KB Output is correct
49 Correct 107 ms 9472 KB Output is correct
50 Correct 104 ms 9324 KB Output is correct
51 Correct 100 ms 9324 KB Output is correct
52 Correct 110 ms 9452 KB Output is correct
53 Correct 101 ms 9324 KB Output is correct