oj.uz

Submission #923915

# Submission time Handle Problem Language Result Execution time Memory
923915 2024-02-08T06:23:28 Z yeediot Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 203 ms 22100 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define F first
#define S second
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    setio();
    int n;
    cin>>n;
    vector<pii>a(n+1);
    for(int i=0;i<=n;i++){
        cin>>a[i].F;
        a[i].S=i;
    }
    vector<int>b(n);
    for(int i=0;i<n;i++)cin>>b[i];
    sort(all(a));
    sort(all(b));
    multiset<int>st;
    for(int i=1;i<=n;i++){
        st.insert(max(a[i].F-b[i-1],0LL));
    }
    vector<int>ans(n+1,0);
    ans[a[0].S]=*st.rbegin();
    for(int i=1;i<=n;i++){
        st.erase(st.find(max(a[i].F-b[i-1],0LL)));
        st.insert(max(a[i-1].F-b[i-1],0LL));
        ans[a[i].S]=*st.rbegin();
    }
    for(int i=0;i<=n;i++){
        cout<<ans[i]<<' ';
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 532 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 141 ms 20316 KB Output is correct
34 Correct 149 ms 21584 KB Output is correct
35 Correct 137 ms 20560 KB Output is correct
36 Correct 143 ms 21004 KB Output is correct
37 Correct 154 ms 22100 KB Output is correct
38 Correct 143 ms 21460 KB Output is correct
39 Correct 191 ms 20484 KB Output is correct
40 Correct 196 ms 20372 KB Output is correct
41 Correct 190 ms 20652 KB Output is correct
42 Correct 189 ms 20564 KB Output is correct
43 Correct 189 ms 20392 KB Output is correct
44 Correct 128 ms 19856 KB Output is correct
45 Correct 129 ms 19932 KB Output is correct
46 Correct 130 ms 19792 KB Output is correct
47 Correct 127 ms 20364 KB Output is correct
48 Correct 132 ms 20308 KB Output is correct
49 Correct 203 ms 21076 KB Output is correct
50 Correct 191 ms 21072 KB Output is correct
51 Correct 197 ms 21072 KB Output is correct
52 Correct 185 ms 21076 KB Output is correct
53 Correct 196 ms 20976 KB Output is correct