oj.uz

Submission #713998

# Submission time Handle Problem Language Result Execution time Memory
713998 2023-03-23T12:42:01 Z europium Arranging Shoes (IOI19_shoes) C++17
100 / 100
 639 ms 150112 KB 
#include "shoes.h"
#include <cstdio>
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <iterator>
#include <set>
#include <map>
#include <math.h>
#include <iomanip>
#include <queue>
#include <unordered_set>
using namespace std;

using ll = long long;

struct segtree{
    int size;
    vector <int> values;

    int NEUTRAL_ELEMENT = 0;

    int merge(int a, int b){
        return a + b;
    }

    void init(int n){
        size = 1;
        while (size < n) size *= 2;
        values.resize(2 * size, 0);
    }

    void build(vector<int> &a, int x, int lx, int rx){
        if (rx - lx == 1){
            if (lx < a.size()){
                values[x] = a[lx];
            }
            return;
        }
        int m = (lx + rx) / 2;
        build(a, 2 * x + 1, lx, m);
        build(a, 2 * x + 2, m, rx);
        values[x] = merge(values[2 * x + 1], values[2 * x + 2]);
    }

    void build(vector<int> &a){
        build(a, 0, 0, size);
    }

    void set(int i, int v, int x, int lx, int rx){
        if (rx - lx == 1){
            values[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if (i < m){
            set(i, v, 2 * x + 1, lx, m);
        }
        else{
            set(i, v, 2 * x + 2, m, rx);
        }
        values[x] = merge(values[2 * x + 1], values[2 * x + 2]);
    }

    void set(int i, int v){
        set(i, v, 0, 0, size);
    }

    int calc(int l, int r, int x, int lx, int rx){
        if (lx >= r || l >= rx) return NEUTRAL_ELEMENT;
        if (lx >= l && rx <= r) return values[x];
        int m = (lx + rx) / 2;
        int s1 = calc(l, r, 2 * x + 1, lx, m);
        int s2 = calc(l, r, 2 * x + 2, m, rx);
        return merge(s1, s2);
    }

    int calc(int l, int r){
        return calc(l, r, 0, 0, size);
    }
};


ll count_swaps(vector<int> a) {
	ll n = a.size();
	ll ans = 0;

	segtree st;
	st.init(n);

	vector<int> used(n, 1);
	st.build(used);

	map<int,queue<int>> pos;

	for (int i = 0; i < n; i++){
		pos[a[i]].push(i + 1);
	}

	for (ll i = 0; i < n; i++){
		if (used[i] == 0) continue;

		int j = pos[-a[i]].front() - 1;

		pos[-a[i]].pop();
		pos[a[i]].pop();

		st.set(i, 0);
		st.set(j, 0);

		used[i] = 0;
		used[j] = 0;

		int val = st.calc(i, j);

		if (a[i] > 0) ans += val + 1;
		else ans += val;
	}

	return ans;
}

Compilation message

shoes.cpp: In member function 'void segtree::build(std::vector<int>&, int, int, int)':
shoes.cpp:39:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             if (lx < a.size()){
      |                 ~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 212 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 300 KB Output is correct
36 Correct 1 ms 304 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 296 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 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 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 7 ms 980 KB Output is correct
21 Correct 8 ms 980 KB Output is correct
22 Correct 73 ms 6200 KB Output is correct
23 Correct 62 ms 6220 KB Output is correct
24 Correct 64 ms 6148 KB Output is correct
25 Correct 61 ms 6176 KB Output is correct
26 Correct 68 ms 6704 KB Output is correct
27 Correct 57 ms 6600 KB Output is correct
28 Correct 64 ms 6748 KB Output is correct
29 Correct 66 ms 6704 KB Output is correct
30 Correct 85 ms 6700 KB Output is correct
31 Correct 68 ms 6808 KB Output is correct
32 Correct 71 ms 6696 KB Output is correct
33 Correct 69 ms 6568 KB Output is correct
34 Correct 66 ms 6756 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 73 ms 6736 KB Output is correct
38 Correct 73 ms 6808 KB Output is correct
39 Correct 74 ms 6704 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 639 ms 149972 KB Output is correct
6 Correct 158 ms 18476 KB Output is correct
7 Correct 512 ms 149920 KB Output is correct
8 Correct 72 ms 6828 KB Output is correct
9 Correct 492 ms 149888 KB Output is correct
10 Correct 385 ms 77968 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 212 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 300 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 3 ms 1748 KB Output is correct
43 Correct 3 ms 1492 KB Output is correct
44 Correct 3 ms 1328 KB Output is correct
45 Correct 2 ms 1236 KB Output is correct
46 Correct 2 ms 1108 KB Output is correct
47 Correct 2 ms 944 KB Output is correct
48 Correct 2 ms 724 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 1 ms 304 KB Output is correct
52 Correct 3 ms 1716 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 212 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 300 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 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 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 296 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 296 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 212 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 8 ms 980 KB Output is correct
56 Correct 73 ms 6200 KB Output is correct
57 Correct 62 ms 6220 KB Output is correct
58 Correct 64 ms 6148 KB Output is correct
59 Correct 61 ms 6176 KB Output is correct
60 Correct 68 ms 6704 KB Output is correct
61 Correct 57 ms 6600 KB Output is correct
62 Correct 64 ms 6748 KB Output is correct
63 Correct 66 ms 6704 KB Output is correct
64 Correct 85 ms 6700 KB Output is correct
65 Correct 68 ms 6808 KB Output is correct
66 Correct 71 ms 6696 KB Output is correct
67 Correct 69 ms 6568 KB Output is correct
68 Correct 66 ms 6756 KB Output is correct
69 Correct 2 ms 212 KB Output is correct
70 Correct 1 ms 296 KB Output is correct
71 Correct 73 ms 6736 KB Output is correct
72 Correct 73 ms 6808 KB Output is correct
73 Correct 74 ms 6704 KB Output is correct
74 Correct 1 ms 296 KB Output is correct
75 Correct 2 ms 308 KB Output is correct
76 Correct 1 ms 304 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 639 ms 149972 KB Output is correct
79 Correct 158 ms 18476 KB Output is correct
80 Correct 512 ms 149920 KB Output is correct
81 Correct 72 ms 6828 KB Output is correct
82 Correct 492 ms 149888 KB Output is correct
83 Correct 385 ms 77968 KB Output is correct
84 Correct 1 ms 296 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 2 ms 428 KB Output is correct
87 Correct 1 ms 596 KB Output is correct
88 Correct 2 ms 1748 KB Output is correct
89 Correct 3 ms 1748 KB Output is correct
90 Correct 3 ms 1492 KB Output is correct
91 Correct 3 ms 1328 KB Output is correct
92 Correct 2 ms 1236 KB Output is correct
93 Correct 2 ms 1108 KB Output is correct
94 Correct 2 ms 944 KB Output is correct
95 Correct 2 ms 724 KB Output is correct
96 Correct 2 ms 596 KB Output is correct
97 Correct 2 ms 340 KB Output is correct
98 Correct 1 ms 304 KB Output is correct
99 Correct 3 ms 1716 KB Output is correct
100 Correct 3 ms 1748 KB Output is correct
101 Correct 36 ms 13856 KB Output is correct
102 Correct 18 ms 3796 KB Output is correct
103 Correct 558 ms 149960 KB Output is correct
104 Correct 517 ms 150004 KB Output is correct
105 Correct 485 ms 87744 KB Output is correct
106 Correct 522 ms 149972 KB Output is correct
107 Correct 203 ms 21836 KB Output is correct
108 Correct 252 ms 37956 KB Output is correct
109 Correct 66 ms 6740 KB Output is correct
110 Correct 62 ms 6696 KB Output is correct
111 Correct 512 ms 134084 KB Output is correct
112 Correct 543 ms 117992 KB Output is correct
113 Correct 280 ms 23728 KB Output is correct
114 Correct 508 ms 149980 KB Output is correct
115 Correct 560 ms 150112 KB Output is correct