oj.uz

Submission #143881

# Submission time Handle Problem Language Result Execution time Memory
143881 2019-08-15T12:06:19 Z stoyan_malinin Arranging Shoes (IOI19_shoes) C++14
50 / 100
 332 ms 147528 KB 
#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<set>

using namespace std;

const int MAXN = 1e5 + 5;

struct fenwickTree
{
    int tree[MAXN*2];

    fenwickTree()
    {
        memset(this->tree, 0, sizeof(this->tree));
    }

    void update(int index, int value)
    {
        index++;
        while(index<MAXN)
        {
            this->tree[index] += value;
            index += index&(-index);
        }
    }

    int query(int index)
    {
        int sum = 0;

        index++;
        while(index>0)
        {
            sum += this->tree[index];
            index -= index&(-index);
        }

        return sum;
    }
};

fenwickTree *T = new fenwickTree();
queue <int> leftShoes[MAXN], rightShoes[MAXN];

int calcValue(int num, int index, int bestLeft, int bestRight)
{
    int sum = (bestLeft - index) + (bestRight - (index+1));
    if(bestLeft>bestRight) sum++;

    return sum;
}

long long count_swaps(vector <int> s)
{
    set <int> allIndexes;
    for(int i = 0;i<s.size();i++)
    {
        allIndexes.insert(i);

        if(s[i]<0) leftShoes[ -s[i] ].push(i);
        else rightShoes[ s[i] ].push(i);
    }

    long long answer = 0;
    for(int index = 0;index<s.size();index+=2)
    {
        int bestIndex = -1;
        int bestLeft, bestRight;

        bestIndex = abs(s[*allIndexes.begin()]);
        allIndexes.erase(leftShoes[bestIndex].front());
        allIndexes.erase(rightShoes[bestIndex].front());

        bestLeft = leftShoes[bestIndex].front() - T->query(leftShoes[bestIndex].front());
        bestRight = rightShoes[bestIndex].front() - T->query(rightShoes[bestIndex].front());

        T->update(leftShoes[bestIndex].front(), 1);
        T->update(rightShoes[bestIndex].front(), 1);

        leftShoes[bestIndex].pop();
        rightShoes[bestIndex].pop();

        //cout << bestLeft << " " << bestRight << '\n';

        answer += calcValue(bestIndex, 0, bestLeft, bestRight);
    }

    //for(int i = 0;i<s.size();i++) cout << s[i] << " ";
    //cout << '\n';

    return answer;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<s.size();i++)
                   ~^~~~~~~~~
shoes.cpp:68:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int index = 0;index<s.size();index+=2)
                       ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 135760 KB Output is correct
2 Correct 138 ms 135800 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 135760 KB Output is correct
2 Correct 138 ms 135800 KB Output is correct
3 Correct 139 ms 135672 KB Output is correct
4 Correct 137 ms 135792 KB Output is correct
5 Correct 140 ms 135672 KB Output is correct
6 Correct 139 ms 135800 KB Output is correct
7 Correct 140 ms 135696 KB Output is correct
8 Correct 139 ms 135752 KB Output is correct
9 Correct 139 ms 135740 KB Output is correct
10 Correct 138 ms 135716 KB Output is correct
11 Correct 139 ms 135676 KB Output is correct
12 Correct 141 ms 135672 KB Output is correct
13 Correct 138 ms 135676 KB Output is correct
14 Correct 155 ms 135752 KB Output is correct
15 Correct 142 ms 135784 KB Output is correct
16 Correct 148 ms 135832 KB Output is correct
17 Correct 139 ms 135724 KB Output is correct
18 Correct 138 ms 135720 KB Output is correct
19 Correct 138 ms 135776 KB Output is correct
20 Correct 139 ms 135716 KB Output is correct
21 Correct 138 ms 135800 KB Output is correct
22 Correct 139 ms 135800 KB Output is correct
23 Correct 141 ms 135924 KB Output is correct
24 Correct 140 ms 135800 KB Output is correct
25 Correct 139 ms 135672 KB Output is correct
26 Correct 140 ms 135772 KB Output is correct
27 Correct 140 ms 135912 KB Output is correct
28 Correct 141 ms 135764 KB Output is correct
29 Correct 139 ms 135800 KB Output is correct
30 Correct 139 ms 135736 KB Output is correct
31 Correct 139 ms 135672 KB Output is correct
32 Correct 141 ms 135820 KB Output is correct
33 Correct 139 ms 135688 KB Output is correct
34 Correct 139 ms 135672 KB Output is correct
35 Correct 139 ms 135692 KB Output is correct
36 Correct 156 ms 135772 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 135760 KB Output is correct
2 Correct 138 ms 135800 KB Output is correct
3 Correct 138 ms 135800 KB Output is correct
4 Correct 139 ms 135800 KB Output is correct
5 Correct 139 ms 135672 KB Output is correct
6 Correct 145 ms 135800 KB Output is correct
7 Correct 147 ms 135812 KB Output is correct
8 Correct 141 ms 135672 KB Output is correct
9 Correct 171 ms 135772 KB Output is correct
10 Correct 158 ms 135720 KB Output is correct
11 Correct 146 ms 135800 KB Output is correct
12 Correct 169 ms 135760 KB Output is correct
13 Correct 152 ms 135672 KB Output is correct
14 Correct 151 ms 135804 KB Output is correct
15 Correct 142 ms 135736 KB Output is correct
16 Correct 138 ms 135800 KB Output is correct
17 Correct 150 ms 135800 KB Output is correct
18 Correct 153 ms 135800 KB Output is correct
19 Correct 155 ms 135928 KB Output is correct
20 Correct 159 ms 137080 KB Output is correct
21 Correct 189 ms 136900 KB Output is correct
22 Incorrect 258 ms 147528 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 135676 KB Output is correct
2 Correct 141 ms 135732 KB Output is correct
3 Correct 143 ms 135792 KB Output is correct
4 Correct 139 ms 135776 KB Output is correct
5 Incorrect 332 ms 146812 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 135760 KB Output is correct
2 Correct 138 ms 135800 KB Output is correct
3 Correct 139 ms 135672 KB Output is correct
4 Correct 137 ms 135792 KB Output is correct
5 Correct 140 ms 135672 KB Output is correct
6 Correct 139 ms 135800 KB Output is correct
7 Correct 140 ms 135696 KB Output is correct
8 Correct 139 ms 135752 KB Output is correct
9 Correct 139 ms 135740 KB Output is correct
10 Correct 138 ms 135716 KB Output is correct
11 Correct 139 ms 135676 KB Output is correct
12 Correct 141 ms 135672 KB Output is correct
13 Correct 138 ms 135676 KB Output is correct
14 Correct 155 ms 135752 KB Output is correct
15 Correct 142 ms 135784 KB Output is correct
16 Correct 148 ms 135832 KB Output is correct
17 Correct 139 ms 135724 KB Output is correct
18 Correct 138 ms 135720 KB Output is correct
19 Correct 138 ms 135776 KB Output is correct
20 Correct 139 ms 135716 KB Output is correct
21 Correct 138 ms 135800 KB Output is correct
22 Correct 139 ms 135800 KB Output is correct
23 Correct 141 ms 135924 KB Output is correct
24 Correct 140 ms 135800 KB Output is correct
25 Correct 139 ms 135672 KB Output is correct
26 Correct 140 ms 135772 KB Output is correct
27 Correct 140 ms 135912 KB Output is correct
28 Correct 141 ms 135764 KB Output is correct
29 Correct 139 ms 135800 KB Output is correct
30 Correct 139 ms 135736 KB Output is correct
31 Correct 139 ms 135672 KB Output is correct
32 Correct 141 ms 135820 KB Output is correct
33 Correct 139 ms 135688 KB Output is correct
34 Correct 139 ms 135672 KB Output is correct
35 Correct 139 ms 135692 KB Output is correct
36 Correct 156 ms 135772 KB Output is correct
37 Correct 140 ms 135728 KB Output is correct
38 Correct 138 ms 135772 KB Output is correct
39 Correct 138 ms 135772 KB Output is correct
40 Correct 139 ms 135800 KB Output is correct
41 Correct 143 ms 135928 KB Output is correct
42 Correct 142 ms 135800 KB Output is correct
43 Correct 138 ms 135800 KB Output is correct
44 Correct 140 ms 135928 KB Output is correct
45 Correct 140 ms 135820 KB Output is correct
46 Correct 141 ms 135928 KB Output is correct
47 Correct 142 ms 135872 KB Output is correct
48 Correct 139 ms 135880 KB Output is correct
49 Correct 139 ms 135820 KB Output is correct
50 Correct 185 ms 135800 KB Output is correct
51 Correct 154 ms 135800 KB Output is correct
52 Correct 140 ms 135800 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 135760 KB Output is correct
2 Correct 138 ms 135800 KB Output is correct
3 Correct 139 ms 135672 KB Output is correct
4 Correct 137 ms 135792 KB Output is correct
5 Correct 140 ms 135672 KB Output is correct
6 Correct 139 ms 135800 KB Output is correct
7 Correct 140 ms 135696 KB Output is correct
8 Correct 139 ms 135752 KB Output is correct
9 Correct 139 ms 135740 KB Output is correct
10 Correct 138 ms 135716 KB Output is correct
11 Correct 139 ms 135676 KB Output is correct
12 Correct 141 ms 135672 KB Output is correct
13 Correct 138 ms 135676 KB Output is correct
14 Correct 155 ms 135752 KB Output is correct
15 Correct 142 ms 135784 KB Output is correct
16 Correct 148 ms 135832 KB Output is correct
17 Correct 139 ms 135724 KB Output is correct
18 Correct 138 ms 135720 KB Output is correct
19 Correct 138 ms 135776 KB Output is correct
20 Correct 139 ms 135716 KB Output is correct
21 Correct 138 ms 135800 KB Output is correct
22 Correct 139 ms 135800 KB Output is correct
23 Correct 141 ms 135924 KB Output is correct
24 Correct 140 ms 135800 KB Output is correct
25 Correct 139 ms 135672 KB Output is correct
26 Correct 140 ms 135772 KB Output is correct
27 Correct 140 ms 135912 KB Output is correct
28 Correct 141 ms 135764 KB Output is correct
29 Correct 139 ms 135800 KB Output is correct
30 Correct 139 ms 135736 KB Output is correct
31 Correct 139 ms 135672 KB Output is correct
32 Correct 141 ms 135820 KB Output is correct
33 Correct 139 ms 135688 KB Output is correct
34 Correct 139 ms 135672 KB Output is correct
35 Correct 139 ms 135692 KB Output is correct
36 Correct 156 ms 135772 KB Output is correct
37 Correct 138 ms 135800 KB Output is correct
38 Correct 139 ms 135800 KB Output is correct
39 Correct 139 ms 135672 KB Output is correct
40 Correct 145 ms 135800 KB Output is correct
41 Correct 147 ms 135812 KB Output is correct
42 Correct 141 ms 135672 KB Output is correct
43 Correct 171 ms 135772 KB Output is correct
44 Correct 158 ms 135720 KB Output is correct
45 Correct 146 ms 135800 KB Output is correct
46 Correct 169 ms 135760 KB Output is correct
47 Correct 152 ms 135672 KB Output is correct
48 Correct 151 ms 135804 KB Output is correct
49 Correct 142 ms 135736 KB Output is correct
50 Correct 138 ms 135800 KB Output is correct
51 Correct 150 ms 135800 KB Output is correct
52 Correct 153 ms 135800 KB Output is correct
53 Correct 155 ms 135928 KB Output is correct
54 Correct 159 ms 137080 KB Output is correct
55 Correct 189 ms 136900 KB Output is correct
56 Incorrect 258 ms 147528 KB Output isn't correct
57 Halted 0 ms 0 KB -