oj.uz

Submission #963858

# Submission time Handle Problem Language Result Execution time Memory
963858 2024-04-15T20:18:54 Z Mher777 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 114 ms 26728 KB 
#define _CRT_SECURE_NO_WARNINGS
#include "shoes.h"
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(998244353);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 200005;
int a[N];
ll f[N];
int id[N];
vi g1[N], g2[N];
int n, m;

void add(int ind, int val) {
    while (ind <= m) {
        f[ind] += val;
        ind += (ind & -ind);
    }
}

ll sum(int ind) {
    ll ret = 0;
    while (ind) {
        ret += f[ind];
        ind -= (ind & -ind);
    }
    return ret;
}

ll qry(int l, int r) {
    if (l > r) return 0;
    return sum(r) - sum(l - 1);
}

ll count_swaps(vi S) {
    m = S.size();
    n = m / 2;
    set<int> st;
    for (int i = 1; i <= m; ++i) {
        a[i] = S[i - 1];
        st.insert(abs(a[i]));
        if (a[i] > 0) g2[a[i]].pub(i);
        else g1[abs(a[i])].pub(i);
    }
    ll ans = 0;
    for (auto elem : st) {
        int sz = (int)g1[elem].size();
        for (int i = 0; i < sz; ++i) {
            if (g1[elem][i] < g2[elem][i]) {
                id[g2[elem][i]] = g1[elem][i];
            }
            else {
                ++ans;
                id[g1[elem][i]] = g2[elem][i];
            }
        }
    }
    for (int i = 1; i <= m; ++i) {
        if (id[i]) {
            add(id[i], -1);
            ans += qry(1, id[i] - 1) * 2ll;
            ans += qry(id[i], i);
        }
        else {
            add(i, 1);
        }
    }
    return ans;
}

Compilation message

shoes.cpp: In function 'll range_sum(ll, ll)':
shoes.cpp:96:21: warning: unused variable 'cnt' [-Wunused-variable]
   96 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
shoes.cpp: In function 'll bin_to_dec(std::string)':
shoes.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12932 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12888 KB Output is correct
18 Correct 2 ms 12888 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12932 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12928 KB Output is correct
23 Correct 3 ms 12888 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 3 ms 12916 KB Output is correct
28 Correct 3 ms 12892 KB Output is correct
29 Correct 3 ms 12892 KB Output is correct
30 Correct 4 ms 12892 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct
32 Correct 3 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12924 KB Output is correct
35 Correct 3 ms 13088 KB Output is correct
36 Correct 3 ms 12892 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 13144 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 3 ms 12908 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 3 ms 12888 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 5 ms 13372 KB Output is correct
21 Correct 5 ms 13148 KB Output is correct
22 Correct 31 ms 16664 KB Output is correct
23 Correct 22 ms 16588 KB Output is correct
24 Correct 26 ms 16596 KB Output is correct
25 Correct 23 ms 16596 KB Output is correct
26 Correct 35 ms 16600 KB Output is correct
27 Correct 26 ms 16452 KB Output is correct
28 Correct 25 ms 16848 KB Output is correct
29 Correct 24 ms 16848 KB Output is correct
30 Correct 26 ms 16768 KB Output is correct
31 Correct 26 ms 16484 KB Output is correct
32 Correct 23 ms 16852 KB Output is correct
33 Correct 23 ms 16516 KB Output is correct
34 Correct 24 ms 16820 KB Output is correct
35 Correct 3 ms 12888 KB Output is correct
36 Correct 3 ms 12888 KB Output is correct
37 Correct 23 ms 16844 KB Output is correct
38 Correct 23 ms 16852 KB Output is correct
39 Correct 28 ms 16848 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 3 ms 12940 KB Output is correct
4 Correct 3 ms 12932 KB Output is correct
5 Correct 114 ms 26728 KB Output is correct
6 Correct 44 ms 17500 KB Output is correct
7 Correct 89 ms 26708 KB Output is correct
8 Correct 24 ms 16764 KB Output is correct
9 Correct 104 ms 26488 KB Output is correct
10 Correct 66 ms 21076 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12932 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12888 KB Output is correct
18 Correct 2 ms 12888 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12932 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12928 KB Output is correct
23 Correct 3 ms 12888 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 3 ms 12916 KB Output is correct
28 Correct 3 ms 12892 KB Output is correct
29 Correct 3 ms 12892 KB Output is correct
30 Correct 4 ms 12892 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct
32 Correct 3 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12924 KB Output is correct
35 Correct 3 ms 13088 KB Output is correct
36 Correct 3 ms 12892 KB Output is correct
37 Correct 3 ms 12888 KB Output is correct
38 Correct 3 ms 12672 KB Output is correct
39 Correct 3 ms 12888 KB Output is correct
40 Correct 2 ms 12892 KB Output is correct
41 Correct 3 ms 12892 KB Output is correct
42 Correct 4 ms 12892 KB Output is correct
43 Correct 3 ms 12892 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12892 KB Output is correct
47 Correct 3 ms 12892 KB Output is correct
48 Correct 3 ms 12892 KB Output is correct
49 Correct 3 ms 12976 KB Output is correct
50 Correct 3 ms 12888 KB Output is correct
51 Correct 3 ms 12892 KB Output is correct
52 Correct 3 ms 12892 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12932 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12888 KB Output is correct
18 Correct 2 ms 12888 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12932 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12928 KB Output is correct
23 Correct 3 ms 12888 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 3 ms 12916 KB Output is correct
28 Correct 3 ms 12892 KB Output is correct
29 Correct 3 ms 12892 KB Output is correct
30 Correct 4 ms 12892 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct
32 Correct 3 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12924 KB Output is correct
35 Correct 3 ms 13088 KB Output is correct
36 Correct 3 ms 12892 KB Output is correct
37 Correct 2 ms 13144 KB Output is correct
38 Correct 3 ms 12892 KB Output is correct
39 Correct 3 ms 12888 KB Output is correct
40 Correct 3 ms 12888 KB Output is correct
41 Correct 3 ms 12892 KB Output is correct
42 Correct 3 ms 12892 KB Output is correct
43 Correct 2 ms 12892 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12892 KB Output is correct
47 Correct 3 ms 12888 KB Output is correct
48 Correct 3 ms 12908 KB Output is correct
49 Correct 3 ms 12892 KB Output is correct
50 Correct 3 ms 12888 KB Output is correct
51 Correct 3 ms 12892 KB Output is correct
52 Correct 3 ms 12892 KB Output is correct
53 Correct 4 ms 12892 KB Output is correct
54 Correct 5 ms 13372 KB Output is correct
55 Correct 5 ms 13148 KB Output is correct
56 Correct 31 ms 16664 KB Output is correct
57 Correct 22 ms 16588 KB Output is correct
58 Correct 26 ms 16596 KB Output is correct
59 Correct 23 ms 16596 KB Output is correct
60 Correct 35 ms 16600 KB Output is correct
61 Correct 26 ms 16452 KB Output is correct
62 Correct 25 ms 16848 KB Output is correct
63 Correct 24 ms 16848 KB Output is correct
64 Correct 26 ms 16768 KB Output is correct
65 Correct 26 ms 16484 KB Output is correct
66 Correct 23 ms 16852 KB Output is correct
67 Correct 23 ms 16516 KB Output is correct
68 Correct 24 ms 16820 KB Output is correct
69 Correct 3 ms 12888 KB Output is correct
70 Correct 3 ms 12888 KB Output is correct
71 Correct 23 ms 16844 KB Output is correct
72 Correct 23 ms 16852 KB Output is correct
73 Correct 28 ms 16848 KB Output is correct
74 Correct 3 ms 12892 KB Output is correct
75 Correct 3 ms 12892 KB Output is correct
76 Correct 3 ms 12940 KB Output is correct
77 Correct 3 ms 12932 KB Output is correct
78 Correct 114 ms 26728 KB Output is correct
79 Correct 44 ms 17500 KB Output is correct
80 Correct 89 ms 26708 KB Output is correct
81 Correct 24 ms 16764 KB Output is correct
82 Correct 104 ms 26488 KB Output is correct
83 Correct 66 ms 21076 KB Output is correct
84 Correct 3 ms 12888 KB Output is correct
85 Correct 3 ms 12672 KB Output is correct
86 Correct 3 ms 12888 KB Output is correct
87 Correct 2 ms 12892 KB Output is correct
88 Correct 3 ms 12892 KB Output is correct
89 Correct 4 ms 12892 KB Output is correct
90 Correct 3 ms 12892 KB Output is correct
91 Correct 3 ms 12892 KB Output is correct
92 Correct 3 ms 12892 KB Output is correct
93 Correct 3 ms 12892 KB Output is correct
94 Correct 3 ms 12892 KB Output is correct
95 Correct 3 ms 12892 KB Output is correct
96 Correct 3 ms 12976 KB Output is correct
97 Correct 3 ms 12888 KB Output is correct
98 Correct 3 ms 12892 KB Output is correct
99 Correct 3 ms 12892 KB Output is correct
100 Correct 3 ms 12892 KB Output is correct
101 Correct 10 ms 14172 KB Output is correct
102 Correct 7 ms 13456 KB Output is correct
103 Correct 113 ms 26520 KB Output is correct
104 Correct 80 ms 26660 KB Output is correct
105 Correct 73 ms 21896 KB Output is correct
106 Correct 99 ms 26708 KB Output is correct
107 Correct 59 ms 17768 KB Output is correct
108 Correct 49 ms 18608 KB Output is correct
109 Correct 24 ms 16840 KB Output is correct
110 Correct 28 ms 16848 KB Output is correct
111 Correct 85 ms 25512 KB Output is correct
112 Correct 86 ms 24144 KB Output is correct
113 Correct 58 ms 17736 KB Output is correct
114 Correct 88 ms 26492 KB Output is correct
115 Correct 96 ms 26576 KB Output is correct