oj.uz

답안 #682754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682754 2023-01-17T00:45:23 Z Paul_Liao_1457 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 268 ms 19376 KB 
//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
 
#define ll long long
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(1e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
using namespace std;

template<class T> using PQ=priority_queue<T,vector<T>,less<T> >;

void file(){
    freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
    freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}

int a[200005],b[200005],init[200005],pre[200005],suf[200005];
map<int,int> ans;

signed main(){
    AC;
    int n; cin>>n;
    FOR(i,1,n+2){
        cin>>a[i]; init[i]=a[i];
    }
    FOR(i,1,n+1) cin>>b[i];
    sort(a+1,a+n+2); sort(b+1,b+1+n);
    FOR(i,1,n+1) pre[i]=max(pre[i-1],a[i]-b[i]);
    REP(i,n,1) suf[i]=max(suf[i+1],a[i+1]-b[i]);
    FOR(i,1,n+2){
        if(!ans.count(a[i])) ans[a[i]]=max(pre[i-1],suf[i]);
        else ans[a[i]]=min(ans[a[i]],max(pre[i-1],suf[i]));
    }
    FOR(i,1,n+2) cout<<ans[init[i]]<<" ";
}


/*

 */

Compilation message

ho_t1.cpp: In function 'void file()':
ho_t1.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 472 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 472 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 476 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 472 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 219 ms 18096 KB Output is correct
34 Correct 268 ms 18872 KB Output is correct
35 Correct 218 ms 18296 KB Output is correct
36 Correct 261 ms 18852 KB Output is correct
37 Correct 234 ms 19376 KB Output is correct
38 Correct 264 ms 19180 KB Output is correct
39 Correct 218 ms 18068 KB Output is correct
40 Correct 228 ms 18092 KB Output is correct
41 Correct 249 ms 18204 KB Output is correct
42 Correct 233 ms 18136 KB Output is correct
43 Correct 231 ms 18048 KB Output is correct
44 Correct 194 ms 17656 KB Output is correct
45 Correct 205 ms 17632 KB Output is correct
46 Correct 198 ms 17536 KB Output is correct
47 Correct 143 ms 10480 KB Output is correct
48 Correct 144 ms 10516 KB Output is correct
49 Correct 210 ms 18640 KB Output is correct
50 Correct 224 ms 18608 KB Output is correct
51 Correct 223 ms 18648 KB Output is correct
52 Correct 245 ms 18668 KB Output is correct
53 Correct 218 ms 18652 KB Output is correct