oj.uz

답안 #922725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922725 2024-02-06T04:24:35 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 86 ms 15544 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define int ll
#define y1 yy
#define ppb pop_back
#define gcd(a,b) __gcd(a,b)
#define in insert

const int dx[4]={-1,0,1,0};
const int dy[4]={0,-1,0,1};

const int inf=1e9;
const int N=1e6;
const int MAX=2e5+10;
const int mod=1e9+7;

int n;
pii a[MAX];
int b[MAX];
int p[MAX],s[MAX];
int ans[MAX];

void solve(){
  cin>>n;
  for(int i=1;i<=n+1;i++){
    cin>>a[i].F;
    a[i].S=i;
  }
  for(int i=1;i<=n;i++)cin>>b[i];
  sort(a+1,a+n+2);
  sort(b+1,b+n+1);
  for(int i=1;i<=n+1;i++){
    p[i]=max(p[i-1],a[i].F-b[i]);
  }
  for(int i=n+1;i>=1;i--){
    s[i]=max(s[i+1],a[i].F-b[i-1]);
  }
  for(int i=1;i<=n+1;i++){
    ans[a[i].S]=max(p[i-1],s[i+1]);
  }
  for(int i=1;i<=n+1;i++)cout<<ans[i]<<" ";
}

main(){
  // freopen("prizes.in", "r", stdin);
  // freopen("prizes.out", "w", stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message

ho_t1.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main(){
      | ^~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2512 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2520 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2544 KB Output is correct
22 Correct 1 ms 2548 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2552 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2552 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2528 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 71 ms 14776 KB Output is correct
34 Correct 86 ms 15184 KB Output is correct
35 Correct 73 ms 14756 KB Output is correct
36 Correct 68 ms 15172 KB Output is correct
37 Correct 72 ms 15544 KB Output is correct
38 Correct 80 ms 15444 KB Output is correct
39 Correct 68 ms 14516 KB Output is correct
40 Correct 69 ms 14416 KB Output is correct
41 Correct 70 ms 14652 KB Output is correct
42 Correct 71 ms 14632 KB Output is correct
43 Correct 67 ms 14420 KB Output is correct
44 Correct 67 ms 14156 KB Output is correct
45 Correct 70 ms 14260 KB Output is correct
46 Correct 66 ms 14164 KB Output is correct
47 Correct 78 ms 14164 KB Output is correct
48 Correct 65 ms 14116 KB Output is correct
49 Correct 77 ms 14640 KB Output is correct
50 Correct 70 ms 14676 KB Output is correct
51 Correct 81 ms 14796 KB Output is correct
52 Correct 71 ms 14676 KB Output is correct
53 Correct 73 ms 14764 KB Output is correct