oj.uz

답안 #707874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707874 2023-03-10T10:45:03 Z Alihan_8 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 108 ms 15532 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
bool chmax(int &x, int y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <pair<int,int>> p;
    vector <int> b(n), res(n+1);
    for ( int i = 0; i <= n; i++ ){
        int x; cin >> x;
        p.pb({x, i});
    }
    for ( auto &i: b ) cin >> i;
    sort(all(b)), sort(all(p));
    vector <int> pref(n), suff(n);
    for ( int i = 0; i < n; i++ ){
        if ( i ) pref[i] = pref[i-1];
        chmax(pref[i], p[i].first-b[i]);
    }
    for ( int i = n-1; i >= 0; i-- ){
        if ( i+1 < n ) suff[i] = suff[i+1];
        chmax(suff[i], p[i+1].first-b[i]);
    }
    res[p[0].second] = suff[0];
    res[p[n].second] = pref.back();
    for ( int i = 1; i < n; i++ ){
        res[p[i].second] = max(pref[i-1], suff[i]);
    }
    for ( auto i: res ) cout << i << ' ';

    cout << '\n';
}

Compilation message

ho_t1.cpp: In function 'void IO(std::string)':
ho_t1.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 420 KB Output is correct
27 Correct 2 ms 468 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 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 420 KB Output is correct
27 Correct 2 ms 468 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 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 81 ms 14440 KB Output is correct
34 Correct 85 ms 14984 KB Output is correct
35 Correct 84 ms 14512 KB Output is correct
36 Correct 84 ms 15084 KB Output is correct
37 Correct 98 ms 15532 KB Output is correct
38 Correct 87 ms 15272 KB Output is correct
39 Correct 100 ms 14316 KB Output is correct
40 Correct 89 ms 14316 KB Output is correct
41 Correct 85 ms 14408 KB Output is correct
42 Correct 83 ms 14364 KB Output is correct
43 Correct 90 ms 14244 KB Output is correct
44 Correct 83 ms 13820 KB Output is correct
45 Correct 86 ms 13868 KB Output is correct
46 Correct 85 ms 13832 KB Output is correct
47 Correct 94 ms 14124 KB Output is correct
48 Correct 108 ms 14128 KB Output is correct
49 Correct 94 ms 14684 KB Output is correct
50 Correct 92 ms 14692 KB Output is correct
51 Correct 87 ms 14680 KB Output is correct
52 Correct 96 ms 14676 KB Output is correct
53 Correct 88 ms 14764 KB Output is correct