oj.uz

답안 #847643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
847643 2023-09-10T05:51:12 Z manhlinh1501 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 455 ms 155476 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define lch id << 1
#define rch id << 1 | 1

const int N = 2e5 + 5;

struct IT {
    int n;
    i64 tree[N << 2];
    i64 lazy[N << 2];

    void down(int id) {
        if(lazy[id] == 0)
            return;

        tree[lch] += lazy[id];
        lazy[lch] += lazy[id];

        tree[rch] += lazy[id];
        lazy[rch] += lazy[id];

        lazy[id] = 0;
    }

    void build(int id, int l, int r) {
        if(l == r) {
            tree[id] = r;
            return;
        }

        int m = l + r >> 1;
        build(lch, l, m);
        build(rch, m + 1, r);
        tree[id] = max(tree[lch], tree[rch]);
    }

    void update(int id, int l, int r, int u, int v, int k) {
        if(r<u or l>v)
            return;

        if(u <= l and r <= v) {
            tree[id] += k;
            lazy[id] += k;
            return;
        }

        int m = l + r >> 1;
        down(id);
        update(lch, l, m, u, v, k);
        update(rch, m + 1, r, u, v, k);
        tree[id] = max(tree[lch], tree[rch]);
    }

    i64 get(int id, int l, int r, int pos) {
        if(r<pos or l>pos)
            return 0;

        if(l == r)
            return tree[id];

        int m = l + r >> 1;
        down(id);
        return max(get(lch, l, m, pos), get(rch, m + 1, r, pos));
    }

    void create(int _n) {
        n = _n;
        build(1, 1, n);
    }

    void update(int l, int r, int k) {
        return update(1, 1, n, l, r, k);
    }

    int get(int pos) {
        return get(1, 1, n, pos);
    }
} ST;

i64 count_swaps(vector<int> a) {
    i64 ans = 0;
    map<int, deque<int>> res;
    int n = a.size();
    ST.create(n);

    for(int i = 0; i < n; i++) {
        if(res[-a[i]].empty())
            res[a[i]].emplace_back(i);

        else {
            int l = res[-a[i]].front() + 1;
            res[-a[i]].pop_front();
            int r = i+1;
            ans += ST.get(r) - ST.get(l) - (a[i] > 0);
            ST.update(l, r, 1);
        }
    }

    return ans;
}

Compilation message

shoes.cpp: In member function 'void IT::build(int, int, int)':
shoes.cpp:34:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |         int m = l + r >> 1;
      |                 ~~^~~
shoes.cpp: In member function 'void IT::update(int, int, int, int, int, int)':
shoes.cpp:50:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |         int m = l + r >> 1;
      |                 ~~^~~
shoes.cpp: In member function 'i64 IT::get(int, int, int, int)':
shoes.cpp:64:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |         int m = l + r >> 1;
      |                 ~~^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 6 ms 3160 KB Output is correct
21 Correct 6 ms 3160 KB Output is correct
22 Correct 54 ms 10316 KB Output is correct
23 Correct 46 ms 10064 KB Output is correct
24 Correct 52 ms 11088 KB Output is correct
25 Correct 55 ms 11344 KB Output is correct
26 Correct 60 ms 11064 KB Output is correct
27 Correct 45 ms 10064 KB Output is correct
28 Correct 55 ms 11344 KB Output is correct
29 Correct 55 ms 11344 KB Output is correct
30 Correct 54 ms 11348 KB Output is correct
31 Correct 55 ms 11088 KB Output is correct
32 Correct 54 ms 11348 KB Output is correct
33 Correct 60 ms 11552 KB Output is correct
34 Correct 56 ms 11344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 54 ms 11344 KB Output is correct
38 Correct 55 ms 11348 KB Output is correct
39 Correct 55 ms 11488 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 413 ms 154264 KB Output is correct
6 Correct 122 ms 23632 KB Output is correct
7 Correct 399 ms 155140 KB Output is correct
8 Correct 57 ms 11484 KB Output is correct
9 Correct 411 ms 155476 KB Output is correct
10 Correct 256 ms 82912 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 2 ms 1880 KB Output is correct
42 Correct 2 ms 1880 KB Output is correct
43 Correct 2 ms 1624 KB Output is correct
44 Correct 2 ms 1368 KB Output is correct
45 Correct 2 ms 1368 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 856 KB Output is correct
49 Correct 1 ms 600 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 2 ms 1880 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 600 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 6 ms 3160 KB Output is correct
55 Correct 6 ms 3160 KB Output is correct
56 Correct 54 ms 10316 KB Output is correct
57 Correct 46 ms 10064 KB Output is correct
58 Correct 52 ms 11088 KB Output is correct
59 Correct 55 ms 11344 KB Output is correct
60 Correct 60 ms 11064 KB Output is correct
61 Correct 45 ms 10064 KB Output is correct
62 Correct 55 ms 11344 KB Output is correct
63 Correct 55 ms 11344 KB Output is correct
64 Correct 54 ms 11348 KB Output is correct
65 Correct 55 ms 11088 KB Output is correct
66 Correct 54 ms 11348 KB Output is correct
67 Correct 60 ms 11552 KB Output is correct
68 Correct 56 ms 11344 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 54 ms 11344 KB Output is correct
72 Correct 55 ms 11348 KB Output is correct
73 Correct 55 ms 11488 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 413 ms 154264 KB Output is correct
79 Correct 122 ms 23632 KB Output is correct
80 Correct 399 ms 155140 KB Output is correct
81 Correct 57 ms 11484 KB Output is correct
82 Correct 411 ms 155476 KB Output is correct
83 Correct 256 ms 82912 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 2 ms 1880 KB Output is correct
89 Correct 2 ms 1880 KB Output is correct
90 Correct 2 ms 1624 KB Output is correct
91 Correct 2 ms 1368 KB Output is correct
92 Correct 2 ms 1368 KB Output is correct
93 Correct 2 ms 1116 KB Output is correct
94 Correct 1 ms 1116 KB Output is correct
95 Correct 1 ms 856 KB Output is correct
96 Correct 1 ms 600 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 2 ms 1880 KB Output is correct
100 Correct 2 ms 1880 KB Output is correct
101 Correct 23 ms 16308 KB Output is correct
102 Correct 14 ms 6232 KB Output is correct
103 Correct 455 ms 155088 KB Output is correct
104 Correct 344 ms 153936 KB Output is correct
105 Correct 286 ms 93192 KB Output is correct
106 Correct 414 ms 154960 KB Output is correct
107 Correct 125 ms 26960 KB Output is correct
108 Correct 144 ms 41952 KB Output is correct
109 Correct 58 ms 11324 KB Output is correct
110 Correct 54 ms 11340 KB Output is correct
111 Correct 396 ms 139088 KB Output is correct
112 Correct 382 ms 122964 KB Output is correct
113 Correct 154 ms 28784 KB Output is correct
114 Correct 395 ms 154960 KB Output is correct
115 Correct 397 ms 154960 KB Output is correct