답안 #345221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345221	2021-01-07T06:56:48 Z	Kerim	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	196 ms	10860 KB

ho_t1

#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
PII arr[MAXN];
int a[MAXN],ans[MAXN],pre[MAXN],suf[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n+1;i++)
    	scanf("%d",&arr[i].ff),arr[i].ss=i;
    sort(arr+1,arr+n+2);
    for(int i=1;i<=n;i++)
    	scanf("%d",a+i);
    sort(a+1,a+n+1);
	for(int j=1;j<n+1;j++)
		pre[j]=max(pre[j-1],arr[j].ff-a[j]);
	for(int j=n+1;j>=1;j--)
		suf[j]=max(suf[j+1],arr[j].ff-a[j-1]);
    for(int i=1;i<=n+1;i++)
    	ans[arr[i].ss]=max(pre[i-1],suf[i+1]);
    for(int i=1;i<=n+1;i++)
    	printf("%d ",ans[i]);
    puts("");
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
ho_t1.cpp:27:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |      scanf("%d",&arr[i].ff),arr[i].ss=i;
      |      ~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:30:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |      scanf("%d",a+i);
      |      ~~~~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

#	결과	실행 시간	메모리	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	308 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 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

#	결과	실행 시간	메모리	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	308 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 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	368 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	2 ms	364 KB	Output is correct
26	Correct	3 ms	364 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	2 ms	364 KB	Output is correct
31	Correct	2 ms	364 KB	Output is correct
32	Correct	2 ms	364 KB	Output is correct

Subtask #3
91.0 / 91.0

#	결과	실행 시간	메모리	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	308 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 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	368 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	2 ms	364 KB	Output is correct
26	Correct	3 ms	364 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	2 ms	364 KB	Output is correct
31	Correct	2 ms	364 KB	Output is correct
32	Correct	2 ms	364 KB	Output is correct
33	Correct	117 ms	8940 KB	Output is correct
34	Correct	196 ms	10476 KB	Output is correct
35	Correct	126 ms	10092 KB	Output is correct
36	Correct	131 ms	10604 KB	Output is correct
37	Correct	154 ms	10860 KB	Output is correct
38	Correct	123 ms	10852 KB	Output is correct
39	Correct	140 ms	9896 KB	Output is correct
40	Correct	131 ms	9800 KB	Output is correct
41	Correct	121 ms	9836 KB	Output is correct
42	Correct	171 ms	9836 KB	Output is correct
43	Correct	145 ms	9940 KB	Output is correct
44	Correct	127 ms	9376 KB	Output is correct
45	Correct	123 ms	9452 KB	Output is correct
46	Correct	118 ms	9452 KB	Output is correct
47	Correct	115 ms	9452 KB	Output is correct
48	Correct	119 ms	9452 KB	Output is correct
49	Correct	126 ms	10220 KB	Output is correct
50	Correct	123 ms	10092 KB	Output is correct
51	Correct	131 ms	10092 KB	Output is correct
52	Correct	127 ms	10092 KB	Output is correct
53	Correct	126 ms	10092 KB	Output is correct

답안 #345221

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 8.0 / 8.0

Subtask #3 91.0 / 91.0

Subtask #1
1.0 / 1.0

Subtask #2
8.0 / 8.0

Subtask #3
91.0 / 91.0