oj.uz

Submission #543627

# Submission time Handle Problem Language Result Execution time Memory
543627 2022-03-31T04:07:14 Z armashka Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 93 ms 15508 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 1e6 + 10;
const int M = 1e3 + 5;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, b[N], pr[N], sf[N], ans[N];
pll a[N];

const void solve(/*Armashka*/) {
    cin >> n;
    for (int i = 1; i <= n + 1; ++ i) cin >> a[i].ft, a[i].sd = i;
    sort(a + 1, a + n + 2);
    for (int i = 1; i <= n; ++ i) cin >> b[i];
    sort(b + 1, b + n + 1);

    for (int i = 1; i <= n; ++ i) pr[i] = max({pr[i - 1], a[i].ft - b[i], 0ll});
    for (int i = n + 1; i > 1; -- i) sf[i] = max({sf[i + 1], a[i].ft - b[i - 1], 0ll});

    for (int i = 1; i <= n + 1; ++ i) {
        if (i == 1) {
            ans[a[i].sd] = sf[i + 1];
        } else if (i == n + 1) {
            ans[a[i].sd] = pr[i - 1];
        } else {
            ans[a[i].sd] = max(pr[i - 1], sf[i + 1]);
        }
    }
    for (int i = 1; i <= n + 1; ++ i) cout << ans[i] << " ";
}  
 
signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;
    // cin >> tt;
    while (tt --) {
        solve();
    }                            
}
// Jelbiretip kok tudy, boys in the hood
// Kim qandai juz, kimde qandai ru

Compilation message

ho_t1.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 2 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 88 ms 14568 KB Output is correct
34 Correct 86 ms 14988 KB Output is correct
35 Correct 83 ms 14564 KB Output is correct
36 Correct 89 ms 14980 KB Output is correct
37 Correct 93 ms 15508 KB Output is correct
38 Correct 86 ms 15372 KB Output is correct
39 Correct 86 ms 14328 KB Output is correct
40 Correct 87 ms 14232 KB Output is correct
41 Correct 91 ms 14416 KB Output is correct
42 Correct 83 ms 14412 KB Output is correct
43 Correct 83 ms 14328 KB Output is correct
44 Correct 82 ms 13856 KB Output is correct
45 Correct 81 ms 13992 KB Output is correct
46 Correct 82 ms 13852 KB Output is correct
47 Correct 80 ms 14072 KB Output is correct
48 Correct 79 ms 14168 KB Output is correct
49 Correct 88 ms 14776 KB Output is correct
50 Correct 88 ms 14744 KB Output is correct
51 Correct 86 ms 14688 KB Output is correct
52 Correct 85 ms 14688 KB Output is correct
53 Correct 85 ms 14692 KB Output is correct