oj.uz

Submission #245750

# Submission time Handle Problem Language Result Execution time Memory
245750 2020-07-07T10:45:31 Z Atill83 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 386 ms 18680 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;

pii a[MAXN];
int b[MAXN];
int ans[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 1; i <= n + 1; i++){
        cin>>a[i].ff;
        a[i].ss = i;
    }

    for(int i = 1; i <= n; i++)
        cin>>b[i];

    sort(a + 1, a + n + 2);
    multiset<int> st;
    sort(b + 1, b + n + 1);
    for(int i = 2; i <= n + 1; i++){
        st.insert(a[i].ff - b[i - 1]);
    }

    ans[a[1].ss] = max(0, *st.rbegin());
    for(int i = 1; i <= n; i++){
        st.erase(st.lower_bound(a[i + 1].ff - b[i]));
        st.insert(a[i].ff - b[i]);
        ans[a[i + 1].ss] = max(0, *st.rbegin());
    }

    for(int i = 1;  i <= n + 1; i++)
        cout<<ans[i]<<" ";
    



    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 7 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 7 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 236 ms 17528 KB Output is correct
34 Correct 241 ms 18296 KB Output is correct
35 Correct 236 ms 17784 KB Output is correct
36 Correct 234 ms 18296 KB Output is correct
37 Correct 244 ms 18680 KB Output is correct
38 Correct 250 ms 18552 KB Output is correct
39 Correct 309 ms 17528 KB Output is correct
40 Correct 322 ms 17404 KB Output is correct
41 Correct 316 ms 17656 KB Output is correct
42 Correct 375 ms 17528 KB Output is correct
43 Correct 310 ms 17400 KB Output is correct
44 Correct 208 ms 16888 KB Output is correct
45 Correct 221 ms 17016 KB Output is correct
46 Correct 215 ms 16900 KB Output is correct
47 Correct 188 ms 17504 KB Output is correct
48 Correct 190 ms 17400 KB Output is correct
49 Correct 345 ms 18168 KB Output is correct
50 Correct 342 ms 17912 KB Output is correct
51 Correct 386 ms 18040 KB Output is correct
52 Correct 320 ms 17912 KB Output is correct
53 Correct 328 ms 17980 KB Output is correct