oj.uz

답안 #245146

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245146 2020-07-05T15:33:23 Z uacoder123 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 126 ms 12536 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  lli test=1;
  for(;test>0;--test)
  {
    int n;
    cin>>n;
    int arr[n],ans[n+1],sam[n],nex[n];
    ii nt[n+1];
    for(int i=0;i<=n;++i)
    {
      cin>>nt[i].F;
      nt[i].S=i;
    }
    sort(nt,nt+n+1);
    for(int i=0;i<n;++i)
      cin>>arr[i];
    sort(arr,arr+n);
    sam[0]=nt[0].F-arr[0];
    nex[n-1]=nt[n].F-arr[n-1];
    for(int i=1;i<n;++i)
      sam[i]=max(sam[i-1]*1LL,max(0*1LL,nt[i].F-arr[i]));
    for(int i=n-2;i>=0;--i)
      nex[i]=max(nex[i+1]*1LL,max(0*1LL,nt[i+1].F-arr[i]));
    for(int i=0;i<=n;++i)
    {
      if(i==0)
        ans[nt[i].S]=nex[0];
      else if(i==n)
        ans[nt[i].S]=sam[n-1];
      else
        ans[nt[i].S]=max(sam[i-1],nex[i]);
    }
    for(int i=0;i<=n;++i)
      cout<<ans[i]<<' ';
    cout<<endl;
  }
  return(0);
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 112 ms 11512 KB Output is correct
34 Correct 118 ms 11932 KB Output is correct
35 Correct 118 ms 11640 KB Output is correct
36 Correct 120 ms 12152 KB Output is correct
37 Correct 126 ms 12536 KB Output is correct
38 Correct 121 ms 12408 KB Output is correct
39 Correct 116 ms 11384 KB Output is correct
40 Correct 116 ms 11256 KB Output is correct
41 Correct 116 ms 11388 KB Output is correct
42 Correct 117 ms 11512 KB Output is correct
43 Correct 115 ms 11256 KB Output is correct
44 Correct 110 ms 10876 KB Output is correct
45 Correct 114 ms 11004 KB Output is correct
46 Correct 108 ms 10872 KB Output is correct
47 Correct 104 ms 11000 KB Output is correct
48 Correct 110 ms 11000 KB Output is correct
49 Correct 114 ms 11640 KB Output is correct
50 Correct 121 ms 11640 KB Output is correct
51 Correct 118 ms 11640 KB Output is correct
52 Correct 119 ms 11640 KB Output is correct
53 Correct 121 ms 11640 KB Output is correct