oj.uz

답안 #762990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762990 2023-06-22T02:09:43 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 353 ms 24136 KB 
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n;
    cin >> n;
    pair<int,int>a[n+4];
    int b[n+4];
    for (int i=1; i<=n+1; i++) {
        cin >> a[i].first;
        a[i].second=i;
    }
    sort(a+1,a+n+1+1);
//    for (int i=1; i<=n+1; i++) {
//        cout << a[i].first << " " << a[i].second << endl;
//    }
    for (int i=1; i<=n; i++) {
        cin >> b[i];
    }
    sort(b+1,b+n+1);
    multiset<int>s;
    int ans[n+4];
    map<int,int>mp;
    for (int i=2; i<=n+1; i++) {
        s.insert(max(a[i].first-b[i-1],0));
        mp[i]=i-1;
        //cout << *--s.end();
        ans[a[1].second]=*--s.end();
    }
    //cout << ans[2] << endl;
    //cout << *--s.end() << endl;
    for (int i=2; i<=n+1; i++) {
        int cur=max(a[i].first-b[mp[i]],0);
        s.erase(s.find(cur));
        s.insert(max(a[i-1].first-b[mp[i]],0));
        mp[i-1]=mp[i];
        //cout << i << " " << a[i].second << endl;
        ans[a[i].second]=*--s.end();
    }
    for (int i=1; i<=n+1; i++) {
        cout << ans[i] << " ";
    }
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 267 ms 22628 KB Output is correct
34 Correct 281 ms 23572 KB Output is correct
35 Correct 246 ms 22768 KB Output is correct
36 Correct 264 ms 23416 KB Output is correct
37 Correct 262 ms 24136 KB Output is correct
38 Correct 255 ms 23756 KB Output is correct
39 Correct 326 ms 22756 KB Output is correct
40 Correct 327 ms 22604 KB Output is correct
41 Correct 318 ms 22860 KB Output is correct
42 Correct 338 ms 22720 KB Output is correct
43 Correct 328 ms 22676 KB Output is correct
44 Correct 229 ms 22116 KB Output is correct
45 Correct 231 ms 22220 KB Output is correct
46 Correct 226 ms 22000 KB Output is correct
47 Correct 239 ms 22732 KB Output is correct
48 Correct 241 ms 22756 KB Output is correct
49 Correct 339 ms 23372 KB Output is correct
50 Correct 332 ms 23368 KB Output is correct
51 Correct 349 ms 23364 KB Output is correct
52 Correct 329 ms 23380 KB Output is correct
53 Correct 353 ms 23376 KB Output is correct