oj.uz

답안 #259484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259484 2020-08-07T22:13:52 Z ChrisT Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 156 ms 11000 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main () {
	int n;
	scanf ("%d",&n);
	vector<pii> v(n+1); vector<int> ans(n+1), a(n);
	for (int i = 0; i <= n; i++) scanf ("%d",&v[i].first), v[i].second = i;
	for (auto &au : a) scanf ("%d",&au);
	sort(v.begin(),v.end());
	sort(a.begin(),a.end());
	vector<int> pma(n), sma(n);
	pma[0] = max(0,v[0].first - a[0]);
	for (int i = 0; i < n; i++) pma[i] = max(pma[i-1],v[i].first - a[i]);
	sma[n-1] = max(0,v[n].first - a[n-1]);
	for (int i = n-2; i >= 0; i--) sma[i] = max(sma[i+1],v[i+1].first - a[i]);
	for (int i = 0; i <= n; i++) {
		ans[v[i].second] = max(i ? pma[i-1] : 0,i == n ? 0 : sma[i]);
	}
	for (int i = 0; i <= n; i++) printf ("%d%c",ans[i]," \n"[i==n]);
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:7:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d",&n);
  ~~~~~~^~~~~~~~~
ho_t1.cpp:9:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i <= n; i++) scanf ("%d",&v[i].first), v[i].second = i;
                               ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:10:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (auto &au : a) scanf ("%d",&au);
                     ~~~~~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 150 ms 9976 KB Output is correct
34 Correct 155 ms 10520 KB Output is correct
35 Correct 142 ms 10104 KB Output is correct
36 Correct 142 ms 10488 KB Output is correct
37 Correct 154 ms 11000 KB Output is correct
38 Correct 156 ms 10872 KB Output is correct
39 Correct 142 ms 9848 KB Output is correct
40 Correct 152 ms 9720 KB Output is correct
41 Correct 145 ms 9848 KB Output is correct
42 Correct 142 ms 9848 KB Output is correct
43 Correct 145 ms 9720 KB Output is correct
44 Correct 139 ms 9336 KB Output is correct
45 Correct 141 ms 9464 KB Output is correct
46 Correct 143 ms 9464 KB Output is correct
47 Correct 125 ms 9464 KB Output is correct
48 Correct 143 ms 9468 KB Output is correct
49 Correct 146 ms 10104 KB Output is correct
50 Correct 150 ms 10104 KB Output is correct
51 Correct 151 ms 10104 KB Output is correct
52 Correct 149 ms 10104 KB Output is correct
53 Correct 145 ms 10104 KB Output is correct