oj.uz

Submission #536013

# Submission time Handle Problem Language Result Execution time Memory
536013 2022-03-12T06:22:56 Z browntoad Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 144 ms 10816 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define RREP1(i,n) for (int i=(n); i>=1; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=5005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================

struct typ{
    int val;
    int id;
    int ans;
};
bool cmp(typ a, typ b){
    return a.val<b.val;
}
bool cmp2(typ a, typ b){
    return a.id<b.id;
}
signed main (){
    IOS();
    int n; cin>>n;
    vector<typ> vc(n+1);
    REP(i,n+1) {
        cin>>vc[i].val;
        vc[i].id=i;
        vc[i].ans=0;
    }
    sort(ALL(vc), cmp);
    vector<int> len(n);
    REP(i,n) cin>>len[i];
    sort(ALL(len));
    vector<int> pf(n);
    REP(i,n){
        pf[i]=vc[i].val-len[i];
        if (i!=0){
            pf[i]=max(pf[i-1], pf[i]);
        }
    }
    int prev=0;
    vc[n].ans=max(pf[n-1], 0ll);
    RREP(i,n){
        int cur=prev;
        cur=max(cur, vc[i+1].val-len[i]);
        if (i>0){
            cur=max(cur, pf[i-1]);
        }
        vc[i].ans=cur;
        prev=max(prev, vc[i].ans);
    }
    sort(ALL(vc), cmp2);
    REP(i,n+1){
        cout<<vc[i].ans<<endl;
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 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 356 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 388 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 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 356 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 388 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 144 ms 10068 KB Output is correct
34 Correct 126 ms 10504 KB Output is correct
35 Correct 134 ms 10092 KB Output is correct
36 Correct 129 ms 10616 KB Output is correct
37 Correct 137 ms 10816 KB Output is correct
38 Correct 134 ms 10700 KB Output is correct
39 Correct 124 ms 9752 KB Output is correct
40 Correct 140 ms 9740 KB Output is correct
41 Correct 126 ms 9932 KB Output is correct
42 Correct 137 ms 9788 KB Output is correct
43 Correct 130 ms 9736 KB Output is correct
44 Correct 119 ms 9420 KB Output is correct
45 Correct 122 ms 9452 KB Output is correct
46 Correct 136 ms 9428 KB Output is correct
47 Correct 116 ms 9416 KB Output is correct
48 Correct 107 ms 9528 KB Output is correct
49 Correct 129 ms 10032 KB Output is correct
50 Correct 141 ms 10068 KB Output is correct
51 Correct 135 ms 10028 KB Output is correct
52 Correct 126 ms 10088 KB Output is correct
53 Correct 136 ms 10036 KB Output is correct