oj.uz

답안 #143197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143197 2019-08-13T10:31:23 Z mlyean00 Arranging Shoes (IOI19_shoes) C++17
70 / 100
 1000 ms 153452 KB 
#include <bits/stdc++.h>

#include "shoes.h"

using namespace std;
using ll = long long;

int sgn(int x) {
    if (x == 0) return 0;
    return x > 0 ? 1 : -1;
}

ll count_inversions(vector<int>& v, int l, int r) {
    if (r - l == 1) return 0;
    int mid = (l + r) / 2;
    ll ans = count_inversions(v, l, mid) + count_inversions(v, mid, r);

    int l_ptr = l, r_ptr = mid;

    vector<int> m;
    m.reserve(r - l);

    while (l_ptr < mid || r_ptr < r) {
        if (l_ptr == mid) {
            m.push_back(v[r_ptr++]);
        } else if (r_ptr == r) {
            ans += r_ptr - mid;
            m.push_back(v[l_ptr++]);
        } else if (v[l_ptr] <= v[r_ptr]) {
            ans += r_ptr - mid;
            m.push_back(v[l_ptr++]);
        } else {
            m.push_back(v[r_ptr++]);
        }
    }

    copy(m.begin(), m.end(), v.begin() + l);

    return ans;
}

ll count_swaps(vector<int> s) {
    int n = s.size() / 2;

    vector<int> t;

    map<int, int> cnt;
    for (int i = 0; i < 2 * n; ++i) {
        int sz = abs(s[i]);
        if (cnt[sz] == 0 || sgn(s[i]) == sgn(cnt[sz])) {
            t.push_back(-sz);
            t.push_back(sz);
        }
        cnt[sz] += sgn(s[i]);
    }
    assert(t.size() == 2 * n);

    map<int, stack<int>> m;
    for (int i = 2 * n - 1; i >= 0; --i) {
        m[s[i]].push(i);
    }

    vector<int> perm(2 * n);
    for (int i = 0; i < 2 * n; ++i) {
        perm[i] = m[t[i]].top();
        m[t[i]].pop();
    }

    return count_inversions(perm, 0, 2 * n);
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from shoes.cpp:1:
shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:56:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(t.size() == 2 * n);
            ~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 8 ms 760 KB Output is correct
21 Correct 8 ms 760 KB Output is correct
22 Correct 63 ms 5016 KB Output is correct
23 Correct 56 ms 5100 KB Output is correct
24 Correct 62 ms 5100 KB Output is correct
25 Correct 73 ms 5228 KB Output is correct
26 Correct 62 ms 5228 KB Output is correct
27 Correct 55 ms 5100 KB Output is correct
28 Correct 56 ms 5272 KB Output is correct
29 Correct 56 ms 5228 KB Output is correct
30 Correct 55 ms 5356 KB Output is correct
31 Correct 62 ms 5100 KB Output is correct
32 Correct 55 ms 5356 KB Output is correct
33 Correct 55 ms 5240 KB Output is correct
34 Correct 55 ms 5356 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 55 ms 5356 KB Output is correct
38 Correct 56 ms 5356 KB Output is correct
39 Correct 55 ms 5356 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Execution timed out 1012 ms 153452 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 424 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 252 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 380 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 3 ms 632 KB Output is correct
41 Correct 6 ms 1784 KB Output is correct
42 Correct 6 ms 1912 KB Output is correct
43 Correct 5 ms 1656 KB Output is correct
44 Correct 5 ms 1528 KB Output is correct
45 Correct 5 ms 1400 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 4 ms 1016 KB Output is correct
48 Correct 4 ms 860 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 3 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 6 ms 1784 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 424 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 252 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 352 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 252 KB Output is correct
40 Correct 2 ms 252 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 3 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 8 ms 760 KB Output is correct
55 Correct 8 ms 760 KB Output is correct
56 Correct 63 ms 5016 KB Output is correct
57 Correct 56 ms 5100 KB Output is correct
58 Correct 62 ms 5100 KB Output is correct
59 Correct 73 ms 5228 KB Output is correct
60 Correct 62 ms 5228 KB Output is correct
61 Correct 55 ms 5100 KB Output is correct
62 Correct 56 ms 5272 KB Output is correct
63 Correct 56 ms 5228 KB Output is correct
64 Correct 55 ms 5356 KB Output is correct
65 Correct 62 ms 5100 KB Output is correct
66 Correct 55 ms 5356 KB Output is correct
67 Correct 55 ms 5240 KB Output is correct
68 Correct 55 ms 5356 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 55 ms 5356 KB Output is correct
72 Correct 56 ms 5356 KB Output is correct
73 Correct 55 ms 5356 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 256 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 256 KB Output is correct
78 Execution timed out 1012 ms 153452 KB Time limit exceeded
79 Halted 0 ms 0 KB -