oj.uz

Submission #312815

# Submission time Handle Problem Language Result Execution time Memory
312815 2020-10-14T11:56:29 Z Basilhijaz Arranging Shoes (IOI19_shoes) C++17
100 / 100
 587 ms 548340 KB 
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

vector<pair<int, int> > pairs;

const int N = 1e6;
long long seg[4*N];
bool done[N];


void build(int p, int s, int e){
    if(s == e){
        seg[p] = 1;
        return;
    }
    build(2*p, s, (s + e)/2);
    build(2*p + 1, (s + e)/2 + 1, e);
    seg[p] = seg[2*p] + seg[2*p + 1];
}

void update(int p, int s, int e, int i){
    if(s == e){
        if(s == i){
            seg[p] = 0;
        }
        return;
    }
    if(i <= (s + e)/2)update(2*p, s, (s + e)/2, i);
    else update(2*p + 1, (s + e)/2 + 1, e, i);
    seg[p] = seg[2*p] + seg[2*p + 1];
}

long long get(int p, int s, int e, int a, int b){
    if(a <= s && b >= e){
        return seg[p];
    }
    else if(b < s || a > e){
        return 0;
    }
    return get(2 * p, s, (s + e)/2, a, b) + get(2 * p + 1, (s + e)/2 + 1, e, a, b);
}
long long count_swaps(vector<int> s) {
    int n = s.size();
    queue<int> left[2*n + 1];
    queue<int> right[2*n + 1];
    for(int i = 0; i < n; i++){
        if(s[i] < 0){
            if(!right[abs(s[i])].empty()){
                pairs.pb({right[abs(s[i])].front(), i});
                right[abs(s[i])].pop();
            }
            else{
                left[abs(s[i])].push(i);
            }
        }
        else{
            if(!left[s[i]].empty()){
                pairs.pb({left[s[i]].front(), i});
                left[s[i]].pop();
            }
            else{
                right[s[i]].push(i);
            }
        }
    }
    build(1, 0, n - 1);
    long long ans = 0;
    sort(pairs.begin(), pairs.end());
    for(int i = 0; i < pairs.size(); i++){
        if(s[pairs[i].first] > 0){
            ans++;
        }
    }
    memset(done, 0, sizeof(done));
    for(int i = 0; i < pairs.size(); i++){
        update(1, 0, n - 1, pairs[i].second);
        ans += get(1, 0, n - 1, pairs[i].first + 1, pairs[i].second - 1);
    }
	return ans;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 1 ms 1280 KB Output is correct
11 Correct 1 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 1 ms 1408 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 3 ms 2944 KB Output is correct
18 Correct 6 ms 6784 KB Output is correct
19 Correct 6 ms 6784 KB Output is correct
20 Correct 54 ms 56056 KB Output is correct
21 Correct 53 ms 56220 KB Output is correct
22 Correct 531 ms 546444 KB Output is correct
23 Correct 536 ms 546580 KB Output is correct
24 Correct 528 ms 546416 KB Output is correct
25 Correct 527 ms 546904 KB Output is correct
26 Correct 532 ms 547712 KB Output is correct
27 Correct 520 ms 547460 KB Output is correct
28 Correct 533 ms 548336 KB Output is correct
29 Correct 533 ms 548208 KB Output is correct
30 Correct 531 ms 548080 KB Output is correct
31 Correct 514 ms 547824 KB Output is correct
32 Correct 529 ms 548208 KB Output is correct
33 Correct 530 ms 547952 KB Output is correct
34 Correct 525 ms 548208 KB Output is correct
35 Correct 1 ms 1280 KB Output is correct
36 Correct 1 ms 1280 KB Output is correct
37 Correct 526 ms 548340 KB Output is correct
38 Correct 529 ms 548208 KB Output is correct
39 Correct 535 ms 548080 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 560 ms 546496 KB Output is correct
6 Correct 539 ms 547732 KB Output is correct
7 Correct 548 ms 547692 KB Output is correct
8 Correct 549 ms 548336 KB Output is correct
9 Correct 557 ms 547672 KB Output is correct
10 Correct 549 ms 547952 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 1 ms 1280 KB Output is correct
11 Correct 1 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 1 ms 1280 KB Output is correct
15 Correct 1 ms 1280 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 1 ms 1280 KB Output is correct
18 Correct 1 ms 1280 KB Output is correct
19 Correct 1 ms 1280 KB Output is correct
20 Correct 1 ms 1280 KB Output is correct
21 Correct 1 ms 1280 KB Output is correct
22 Correct 1 ms 1280 KB Output is correct
23 Correct 1 ms 1280 KB Output is correct
24 Correct 1 ms 1280 KB Output is correct
25 Correct 1 ms 1280 KB Output is correct
26 Correct 1 ms 1280 KB Output is correct
27 Correct 1 ms 1280 KB Output is correct
28 Correct 1 ms 1280 KB Output is correct
29 Correct 1 ms 1280 KB Output is correct
30 Correct 1 ms 1280 KB Output is correct
31 Correct 1 ms 1280 KB Output is correct
32 Correct 1 ms 1280 KB Output is correct
33 Correct 1 ms 1280 KB Output is correct
34 Correct 1 ms 1280 KB Output is correct
35 Correct 1 ms 1280 KB Output is correct
36 Correct 1 ms 1280 KB Output is correct
37 Correct 1 ms 1280 KB Output is correct
38 Correct 1 ms 1280 KB Output is correct
39 Correct 1 ms 1280 KB Output is correct
40 Correct 1 ms 1280 KB Output is correct
41 Correct 1 ms 1280 KB Output is correct
42 Correct 1 ms 1280 KB Output is correct
43 Correct 1 ms 1280 KB Output is correct
44 Correct 1 ms 1280 KB Output is correct
45 Correct 1 ms 1280 KB Output is correct
46 Correct 1 ms 1280 KB Output is correct
47 Correct 1 ms 1280 KB Output is correct
48 Correct 1 ms 1408 KB Output is correct
49 Correct 1 ms 1536 KB Output is correct
50 Correct 2 ms 1920 KB Output is correct
51 Correct 3 ms 2944 KB Output is correct
52 Correct 6 ms 6784 KB Output is correct
53 Correct 6 ms 6784 KB Output is correct
54 Correct 54 ms 56056 KB Output is correct
55 Correct 53 ms 56220 KB Output is correct
56 Correct 531 ms 546444 KB Output is correct
57 Correct 536 ms 546580 KB Output is correct
58 Correct 528 ms 546416 KB Output is correct
59 Correct 527 ms 546904 KB Output is correct
60 Correct 532 ms 547712 KB Output is correct
61 Correct 520 ms 547460 KB Output is correct
62 Correct 533 ms 548336 KB Output is correct
63 Correct 533 ms 548208 KB Output is correct
64 Correct 531 ms 548080 KB Output is correct
65 Correct 514 ms 547824 KB Output is correct
66 Correct 529 ms 548208 KB Output is correct
67 Correct 530 ms 547952 KB Output is correct
68 Correct 525 ms 548208 KB Output is correct
69 Correct 1 ms 1280 KB Output is correct
70 Correct 1 ms 1280 KB Output is correct
71 Correct 526 ms 548340 KB Output is correct
72 Correct 529 ms 548208 KB Output is correct
73 Correct 535 ms 548080 KB Output is correct
74 Correct 1 ms 1280 KB Output is correct
75 Correct 1 ms 1280 KB Output is correct
76 Correct 1 ms 1280 KB Output is correct
77 Correct 1 ms 1280 KB Output is correct
78 Correct 560 ms 546496 KB Output is correct
79 Correct 539 ms 547732 KB Output is correct
80 Correct 548 ms 547692 KB Output is correct
81 Correct 549 ms 548336 KB Output is correct
82 Correct 557 ms 547672 KB Output is correct
83 Correct 549 ms 547952 KB Output is correct
84 Correct 1 ms 1408 KB Output is correct
85 Correct 1 ms 1536 KB Output is correct
86 Correct 2 ms 1920 KB Output is correct
87 Correct 2 ms 2944 KB Output is correct
88 Correct 6 ms 6784 KB Output is correct
89 Correct 6 ms 6784 KB Output is correct
90 Correct 6 ms 6784 KB Output is correct
91 Correct 6 ms 6784 KB Output is correct
92 Correct 6 ms 6784 KB Output is correct
93 Correct 6 ms 6784 KB Output is correct
94 Correct 6 ms 6784 KB Output is correct
95 Correct 6 ms 6784 KB Output is correct
96 Correct 6 ms 6784 KB Output is correct
97 Correct 6 ms 6784 KB Output is correct
98 Correct 6 ms 6784 KB Output is correct
99 Correct 6 ms 6912 KB Output is correct
100 Correct 6 ms 6784 KB Output is correct
101 Correct 57 ms 56056 KB Output is correct
102 Correct 57 ms 56184 KB Output is correct
103 Correct 584 ms 547760 KB Output is correct
104 Correct 541 ms 547696 KB Output is correct
105 Correct 565 ms 547696 KB Output is correct
106 Correct 545 ms 547824 KB Output is correct
107 Correct 555 ms 547692 KB Output is correct
108 Correct 540 ms 547824 KB Output is correct
109 Correct 534 ms 548120 KB Output is correct
110 Correct 547 ms 548080 KB Output is correct
111 Correct 558 ms 547632 KB Output is correct
112 Correct 586 ms 547824 KB Output is correct
113 Correct 587 ms 547836 KB Output is correct
114 Correct 564 ms 547824 KB Output is correct
115 Correct 555 ms 547956 KB Output is correct