oj.uz

Submission #205312

# Submission time Handle Problem Language Result Execution time Memory
205312 2020-02-28T14:07:58 Z TadijaSebez Just Long Neckties (JOI20_ho_t1) C++11
100 / 100
 148 ms 7036 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=200050;
int b[N],l[N],r[N];
pair<int,int> a[N];
int c[N];
int main(){
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n+1;i++)scanf("%i",&a[i].first),a[i].second=i;
	for(int i=1;i<=n;i++)scanf("%i",&b[i]);
	sort(a+1,a+1+n+1);sort(b+1,b+1+n);
	for(int i=1;i<=n;i++)l[i]=max(l[i-1],a[i].first-b[i]);
	for(int i=n;i>=1;i--)r[i]=max(r[i+1],a[i+1].first-b[i]);
	for(int i=0;i<=n;i++)c[a[i+1].second]=max(l[i],r[i+1]);
	for(int i=1;i<=n+1;i++)printf("%i ",c[i]);printf("\n");
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:16:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for(int i=1;i<=n+1;i++)printf("%i ",c[i]);printf("\n");
  ^~~
ho_t1.cpp:16:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for(int i=1;i<=n+1;i++)printf("%i ",c[i]);printf("\n");
                                            ^~~~~~
ho_t1.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
ho_t1.cpp:10:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n+1;i++)scanf("%i",&a[i].first),a[i].second=i;
                         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
ho_t1.cpp:11:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++)scanf("%i",&b[i]);
                       ~~~~~^~~~~~~~~~~~

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 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 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 5 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 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 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 5 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 376 KB Output is correct
14 Correct 5 ms 376 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 632 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 6 ms 376 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 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 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 5 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 376 KB Output is correct
14 Correct 5 ms 376 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 632 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 137 ms 6392 KB Output is correct
34 Correct 141 ms 6648 KB Output is correct
35 Correct 142 ms 6408 KB Output is correct
36 Correct 147 ms 6904 KB Output is correct
37 Correct 146 ms 7036 KB Output is correct
38 Correct 147 ms 7032 KB Output is correct
39 Correct 143 ms 6008 KB Output is correct
40 Correct 148 ms 6008 KB Output is correct
41 Correct 140 ms 6136 KB Output is correct
42 Correct 143 ms 6264 KB Output is correct
43 Correct 143 ms 6136 KB Output is correct
44 Correct 137 ms 5752 KB Output is correct
45 Correct 141 ms 5880 KB Output is correct
46 Correct 135 ms 5752 KB Output is correct
47 Correct 126 ms 5624 KB Output is correct
48 Correct 128 ms 5752 KB Output is correct
49 Correct 142 ms 6264 KB Output is correct
50 Correct 147 ms 6264 KB Output is correct
51 Correct 148 ms 6264 KB Output is correct
52 Correct 148 ms 6136 KB Output is correct
53 Correct 141 ms 6140 KB Output is correct