oj.uz

Submission #723312

# Submission time Handle Problem Language Result Execution time Memory
723312 2023-04-13T14:23:55 Z josiftepe Arranging Shoes (IOI19_shoes) C++14
100 / 100
 605 ms 152008 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <queue>
#include "shoes.h"
using namespace std;
typedef long long  ll;
const int maxn = 2e5 + 10;
ll segment_tree[3 * maxn];
void build_tree(int L, int R, int position) {
    if(L == R) {
        segment_tree[position] = 0;
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * position);
        build_tree(middle + 1, R, 2 * position + 1);
        segment_tree[position] = segment_tree[2 * position] + segment_tree[2 * position + 1];
    }
}
// L R i L R j L R
ll query(int L, int R, int position, int i, int j) {
    if(i <= L and R <= j) {
        return segment_tree[position];
    }
    if(R < i or j < L) {
        return 0;
    }
    int middle = (L + R) / 2;
    return query(L, middle, 2 * position, i, j) + query(middle + 1, R, 2 * position + 1, i, j);
}
void update(int L, int R, int position, int idx, ll new_val) {
    if(L == R) {
        segment_tree[position] += new_val;
        return;
    }
    int middle = (L + R) / 2;
    if(idx <= middle) {
        update(L, middle, 2 * position, idx, new_val);
    }
    else {
        update(middle + 1, R, 2 * position + 1, idx, new_val);
    }
    segment_tree[position] = segment_tree[2 * position] + segment_tree[2 * position + 1];
}
ll count_swaps(vector<int> v) {
    map<int, queue<int> > m;
    vector<int> S;
    int cnt = 0;
    for(int i = 0; i < v.size(); i++) {
        if(!m[v[i]].empty()) {
            S.push_back(m[v[i]].front());
            m[v[i]].pop();
        }
        else {
            int r = 0;
            if(v[i] > 0) {
                r = 1;
            }
            S.push_back(2 * cnt + r);
            m[-v[i]].push(2 * cnt + (1 - r));
            cnt++;
            
        }
    }
    build_tree(0, (int) v.size() + 1, 1);
    ll res = 0;
    for(int i = 0; i < (int) S.size(); i++) {
        update(0, (int) v.size() + 1, 1, S[i], 1);
        res += query(0, (int) v.size() + 1, 1, S[i] + 1, v.size());
    }
    return res;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 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 312 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 1 ms 304 KB Output is correct
21 Correct 1 ms 308 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 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 1 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 308 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 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 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 8 ms 1120 KB Output is correct
21 Correct 8 ms 1108 KB Output is correct
22 Correct 84 ms 6780 KB Output is correct
23 Correct 86 ms 6856 KB Output is correct
24 Correct 83 ms 6848 KB Output is correct
25 Correct 78 ms 7104 KB Output is correct
26 Correct 85 ms 6856 KB Output is correct
27 Correct 91 ms 6780 KB Output is correct
28 Correct 79 ms 7108 KB Output is correct
29 Correct 81 ms 7112 KB Output is correct
30 Correct 78 ms 7112 KB Output is correct
31 Correct 86 ms 6840 KB Output is correct
32 Correct 85 ms 7112 KB Output is correct
33 Correct 80 ms 7108 KB Output is correct
34 Correct 91 ms 7092 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 83 ms 7108 KB Output is correct
38 Correct 78 ms 7108 KB Output is correct
39 Correct 89 ms 7096 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 469 ms 150728 KB Output is correct
6 Correct 185 ms 19364 KB Output is correct
7 Correct 456 ms 150776 KB Output is correct
8 Correct 90 ms 7112 KB Output is correct
9 Correct 467 ms 150824 KB Output is correct
10 Correct 364 ms 78776 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 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 312 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 1 ms 304 KB Output is correct
21 Correct 1 ms 308 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 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 1 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 308 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 432 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 1748 KB Output is correct
42 Correct 3 ms 1720 KB Output is correct
43 Correct 2 ms 1600 KB Output is correct
44 Correct 3 ms 1364 KB Output is correct
45 Correct 4 ms 1236 KB Output is correct
46 Correct 2 ms 1108 KB Output is correct
47 Correct 2 ms 980 KB Output is correct
48 Correct 2 ms 852 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 3 ms 1748 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 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 312 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 1 ms 304 KB Output is correct
21 Correct 1 ms 308 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 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 1 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 308 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 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 8 ms 1120 KB Output is correct
55 Correct 8 ms 1108 KB Output is correct
56 Correct 84 ms 6780 KB Output is correct
57 Correct 86 ms 6856 KB Output is correct
58 Correct 83 ms 6848 KB Output is correct
59 Correct 78 ms 7104 KB Output is correct
60 Correct 85 ms 6856 KB Output is correct
61 Correct 91 ms 6780 KB Output is correct
62 Correct 79 ms 7108 KB Output is correct
63 Correct 81 ms 7112 KB Output is correct
64 Correct 78 ms 7112 KB Output is correct
65 Correct 86 ms 6840 KB Output is correct
66 Correct 85 ms 7112 KB Output is correct
67 Correct 80 ms 7108 KB Output is correct
68 Correct 91 ms 7092 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 83 ms 7108 KB Output is correct
72 Correct 78 ms 7108 KB Output is correct
73 Correct 89 ms 7096 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 469 ms 150728 KB Output is correct
79 Correct 185 ms 19364 KB Output is correct
80 Correct 456 ms 150776 KB Output is correct
81 Correct 90 ms 7112 KB Output is correct
82 Correct 467 ms 150824 KB Output is correct
83 Correct 364 ms 78776 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 432 KB Output is correct
87 Correct 2 ms 596 KB Output is correct
88 Correct 3 ms 1748 KB Output is correct
89 Correct 3 ms 1720 KB Output is correct
90 Correct 2 ms 1600 KB Output is correct
91 Correct 3 ms 1364 KB Output is correct
92 Correct 4 ms 1236 KB Output is correct
93 Correct 2 ms 1108 KB Output is correct
94 Correct 2 ms 980 KB Output is correct
95 Correct 2 ms 852 KB Output is correct
96 Correct 2 ms 596 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 3 ms 1748 KB Output is correct
100 Correct 3 ms 1748 KB Output is correct
101 Correct 29 ms 14044 KB Output is correct
102 Correct 16 ms 4076 KB Output is correct
103 Correct 534 ms 151964 KB Output is correct
104 Correct 431 ms 152008 KB Output is correct
105 Correct 371 ms 89796 KB Output is correct
106 Correct 506 ms 151972 KB Output is correct
107 Correct 181 ms 24000 KB Output is correct
108 Correct 221 ms 39936 KB Output is correct
109 Correct 85 ms 8384 KB Output is correct
110 Correct 86 ms 8368 KB Output is correct
111 Correct 464 ms 135944 KB Output is correct
112 Correct 439 ms 119916 KB Output is correct
113 Correct 203 ms 25664 KB Output is correct
114 Correct 605 ms 151980 KB Output is correct
115 Correct 457 ms 151976 KB Output is correct