oj.uz

답안 #687346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
687346 2023-01-26T10:34:40 Z Nelt Arranging Shoes (IOI19_shoes) C++17
100 / 100
 80 ms 18768 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <shoes.h>
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
struct SegTree
{
    ll n;
    vv(ll) st;
    SegTree(ll sz = 0, bool input = false)
    {
        n = sz;
        st.resize((n + 1) << 1, 0);
    }
    void set(ll i, ll val)
    {
        st[i + n - 1] = val;
    }
    void build()
    {
        for (ll i = n - 1; i >= 1; i--)
            st[i] = st[i << 1] + st[i << 1 | 1];
    }
    void modify(ll p, ll val)
    {
        for (st[p += n - 1] = val; p > 1; p >>= 1)
            st[p >> 1] = st[p] + st[p ^ 1];
    }
    ll query(ll l, ll r)
    {
        ll ans = 0;
        for (l += n - 1, r += n; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                ans += st[l++];
            if (r & 1)
                ans += st[--r];
        }
        return ans;
    }
};
ll count_swaps(std::vector<int> a)
{
    ll n = a.size() >> 1;
    SegTree st(n << 1);
    vv(ll) lef[n + 1], rig[n + 1];
    for (ll i = 0; i < (n << 1); i++)
        if (a[i] < 0)
            lef[-a[i]].pb(i + 1);
        else
            rig[a[i]].pb(i + 1);
    ll ans = 0;
    pp(ll, ll) p[n];
    ll ptr = 0;
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = 0; j < lef[i].size(); j++)
        {
            if (lef[i][j] > rig[i][j])
                swap(lef[i][j], rig[i][j]), ans++;
            p[ptr++] = mpr(lef[i][j], rig[i][j]);
        }
    }
    sort(all(p));
    for (ll i = 0; i < n; i++)
    {
        ans += p[i].S - p[i].F - 1 - st.query(p[i].F, p[i].S);
        st.modify(p[i].S, 1);
    }
    return ans;
}
void solve()
{
    ll n;
    cin >> n;
    vv(int) a(n << 1);
    for (int &i : a)
        cin >> i;
    cout << count_swaps(a) << endl;
}
/*

*/
// int main()
// {
//     // sync
//         // precomp();
//         ll t = 1;
//     cin >> t;
//     for (ll i = 1; i <= t; i++)
//         // cout << "Case #" << i << ": ",
//         solve();
//     cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:90:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |         for (ll j = 0; j < lef[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 4 ms 1720 KB Output is correct
21 Correct 4 ms 1748 KB Output is correct
22 Correct 37 ms 14232 KB Output is correct
23 Correct 34 ms 14264 KB Output is correct
24 Correct 34 ms 14132 KB Output is correct
25 Correct 37 ms 13984 KB Output is correct
26 Correct 37 ms 14228 KB Output is correct
27 Correct 30 ms 14108 KB Output is correct
28 Correct 34 ms 14132 KB Output is correct
29 Correct 39 ms 14124 KB Output is correct
30 Correct 34 ms 14236 KB Output is correct
31 Correct 38 ms 14172 KB Output is correct
32 Correct 33 ms 14116 KB Output is correct
33 Correct 36 ms 13996 KB Output is correct
34 Correct 35 ms 14232 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 32 ms 14112 KB Output is correct
38 Correct 34 ms 14116 KB Output is correct
39 Correct 34 ms 14108 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 61 ms 18768 KB Output is correct
6 Correct 45 ms 15052 KB Output is correct
7 Correct 59 ms 18740 KB Output is correct
8 Correct 36 ms 14716 KB Output is correct
9 Correct 59 ms 18640 KB Output is correct
10 Correct 56 ms 16076 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 308 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 240 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 436 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 440 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 444 KB Output is correct
48 Correct 1 ms 380 KB Output is correct
49 Correct 1 ms 436 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 308 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 240 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 300 KB Output is correct
38 Correct 1 ms 300 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 300 KB Output is correct
44 Correct 1 ms 300 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 304 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 440 KB Output is correct
53 Correct 1 ms 440 KB Output is correct
54 Correct 4 ms 1720 KB Output is correct
55 Correct 4 ms 1748 KB Output is correct
56 Correct 37 ms 14232 KB Output is correct
57 Correct 34 ms 14264 KB Output is correct
58 Correct 34 ms 14132 KB Output is correct
59 Correct 37 ms 13984 KB Output is correct
60 Correct 37 ms 14228 KB Output is correct
61 Correct 30 ms 14108 KB Output is correct
62 Correct 34 ms 14132 KB Output is correct
63 Correct 39 ms 14124 KB Output is correct
64 Correct 34 ms 14236 KB Output is correct
65 Correct 38 ms 14172 KB Output is correct
66 Correct 33 ms 14116 KB Output is correct
67 Correct 36 ms 13996 KB Output is correct
68 Correct 35 ms 14232 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 32 ms 14112 KB Output is correct
72 Correct 34 ms 14116 KB Output is correct
73 Correct 34 ms 14108 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 220 KB Output is correct
76 Correct 1 ms 304 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 61 ms 18768 KB Output is correct
79 Correct 45 ms 15052 KB Output is correct
80 Correct 59 ms 18740 KB Output is correct
81 Correct 36 ms 14716 KB Output is correct
82 Correct 59 ms 18640 KB Output is correct
83 Correct 56 ms 16076 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 212 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 468 KB Output is correct
89 Correct 1 ms 468 KB Output is correct
90 Correct 1 ms 436 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 440 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 444 KB Output is correct
95 Correct 1 ms 380 KB Output is correct
96 Correct 1 ms 436 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 1 ms 468 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 7 ms 1980 KB Output is correct
102 Correct 6 ms 1748 KB Output is correct
103 Correct 80 ms 18636 KB Output is correct
104 Correct 70 ms 18732 KB Output is correct
105 Correct 66 ms 16360 KB Output is correct
106 Correct 64 ms 18720 KB Output is correct
107 Correct 47 ms 15132 KB Output is correct
108 Correct 46 ms 15448 KB Output is correct
109 Correct 41 ms 14872 KB Output is correct
110 Correct 32 ms 14112 KB Output is correct
111 Correct 59 ms 17996 KB Output is correct
112 Correct 75 ms 17328 KB Output is correct
113 Correct 54 ms 15052 KB Output is correct
114 Correct 60 ms 18768 KB Output is correct
115 Correct 61 ms 18708 KB Output is correct