oj.uz

답안 #567091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567091 2022-05-23T07:58:08 Z Majid Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 120 ms 12352 KB 
#include<bits/stdc++.h>
using namespace std;
 
//Types
using ll = long long;
using db = double;
 
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
 
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);

void solve(){

    ll n;
    cin>>n;
    
    vector<pair<ll, ll> > a;
    vector<ll> b(n);
    
    for(ll i = 0; i < n+1; i++){
        
        ll v;
        cin>>v;
        
        a.pb({v, i});
    }
    
    for(ll i = 0; i < n; i++){
        
        cin>>b[i];
    }
    
    sort(all(a));
    sort(all(b));
    
    vector<ll> orig(n);
    ll mx = 0;
    
    for(ll i = n-1; i >= 0; i--){
    
        orig[i] = max(0ll, a[i].f - b[i]);
        mx = max(mx, orig[i]);
    }
    
    
    vector<ll> ans(n+1), ch(n);
    ans[a[n].s] = mx;
    
    for(ll i = n-1; i >= 0; i--){
        
        ans[a[i].s] = max(ans[a[i+1].s], max(0ll, a[i+1].f - b[i]));
    }
    
    for(ll i = 0; i < n+1; i++)cout<<ans[i]<<" ";
    
}


int main(){
	Speeed
	
    ll t=1;
    // cin>>t;
    
    while(t--){
        
        solve();
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 388 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 428 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 400 KB Output is correct
33 Correct 95 ms 11316 KB Output is correct
34 Correct 93 ms 11964 KB Output is correct
35 Correct 97 ms 11448 KB Output is correct
36 Correct 93 ms 11988 KB Output is correct
37 Correct 88 ms 12352 KB Output is correct
38 Correct 120 ms 12180 KB Output is correct
39 Correct 86 ms 11372 KB Output is correct
40 Correct 92 ms 11176 KB Output is correct
41 Correct 97 ms 11348 KB Output is correct
42 Correct 90 ms 11332 KB Output is correct
43 Correct 88 ms 11148 KB Output is correct
44 Correct 89 ms 10744 KB Output is correct
45 Correct 93 ms 10812 KB Output is correct
46 Correct 92 ms 10744 KB Output is correct
47 Correct 94 ms 10960 KB Output is correct
48 Correct 93 ms 11000 KB Output is correct
49 Correct 87 ms 11708 KB Output is correct
50 Correct 100 ms 11636 KB Output is correct
51 Correct 89 ms 11612 KB Output is correct
52 Correct 93 ms 11656 KB Output is correct
53 Correct 95 ms 11676 KB Output is correct