oj.uz

답안 #567412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567412 2022-05-23T12:28:14 Z AbdullahMW Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 406 ms 54004 KB 
#include <bits/stdc++.h>

#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007

using namespace std;

#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(15);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

int main()
{
    fast
    //setIO("");
    
    //freopen("filename.in", "r", stdin);
    //freopen("filename.out", "w", stdout);
  
    ll n; cin >> n;
    vector <ll> nw(n + 1), init(n);
    unordered_map <ll, vector <ll>> occ;
    unordered_map <ll, ll> idx, ans;
    for (ll i = 0; i <= n; i++) 
    {
        cin >> nw[i];
        occ[nw[i]].pb(i);
    }
    for (ll i = 0; i < n; i++) cin >> init[i];
    sort(all(nw));
    sort(all(init));
    
    for (ll i = n; i >= 0; i--)
    {
        idx[i] = occ[nw[i]].back();
        occ[nw[i]].pop_back();
    }
    
    priority_queue <pair <ll, pair <ll, ll>>> pq;

    //cout << newl;
    for (ll i = 1; i <= n; i++)
    {
        pq.push({max(nw[i] - init[i - 1], (ll) 0), {2, i}});
    }
    //cout << newl << newl;
    
    for (ll i = 0; i <= n; i++)
    {
        if (i != 0)
        {
            pq.push({max(nw[i - 1] - init[i - 1], (ll) 0), {1, 0}});
            while (pq.size() && pq.top().s.f == 2 && pq.top().s.s <= i)
            {
                pq.pop();
            }
        }
        ans[idx[i]] = pq.top().f;
    }
    
    for (ll i = 0; i <= n; i++)
    {
        cout << ans[i] << ' ';
    }
    
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 516 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 2 ms 620 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 308 ms 49560 KB Output is correct
34 Correct 335 ms 53528 KB Output is correct
35 Correct 331 ms 51924 KB Output is correct
36 Correct 287 ms 52704 KB Output is correct
37 Correct 343 ms 54004 KB Output is correct
38 Correct 298 ms 53348 KB Output is correct
39 Correct 357 ms 51264 KB Output is correct
40 Correct 380 ms 51072 KB Output is correct
41 Correct 355 ms 51448 KB Output is correct
42 Correct 386 ms 51336 KB Output is correct
43 Correct 384 ms 51124 KB Output is correct
44 Correct 301 ms 46676 KB Output is correct
45 Correct 359 ms 46884 KB Output is correct
46 Correct 307 ms 46628 KB Output is correct
47 Correct 170 ms 37960 KB Output is correct
48 Correct 169 ms 37952 KB Output is correct
49 Correct 381 ms 52392 KB Output is correct
50 Correct 381 ms 52436 KB Output is correct
51 Correct 367 ms 52320 KB Output is correct
52 Correct 406 ms 52344 KB Output is correct
53 Correct 365 ms 52332 KB Output is correct