oj.uz

Submission #269777

# Submission time Handle Problem Language Result Execution time Memory
269777 2020-08-17T10:11:51 Z Puddlestomps Arranging Shoes (IOI19_shoes) C++14
100 / 100
 64 ms 9732 KB 
#include "bits/stdc++.h"

using namespace std;

constexpr int MAXN = 1 << 18;
array<int, MAXN * 2> segTree;
array<bool, MAXN> starts; // true if swapped
array<int, MAXN> linked;
//Queue for same shoes to get matched
array<int, MAXN> qfront, qlinks, qback; //Takes sn and gives first position of that shoe size in q, links between positions for what next should be after qfront is used, takes sn and gives position of last thing in q

//pos goes from 0
void put(int pos, int val)
{
    pos += MAXN;
    int diff = val - segTree[pos];
    while(pos > 0)
    {
        segTree[pos] += diff;
        pos = pos >> 1;
    }
}

//pos from 0, inclusive
int qry(int left, int right)
{
    int total = 0;
    left += MAXN;
    right += MAXN;
    while(left < right)
    {
        if((left & 1) == 1)
        {
            total += segTree[left];
            left++;
        }
        if((right & 1) == 0)
        {
            total += segTree[right];
            right--;
        }
        left = left >> 1;
        right = right >> 1;
    }

    if(left == right) total += segTree[left];

    return total;
}

long long count_swaps(vector<int> S)
{
    segTree.fill(0);
    starts.fill(false);
    linked.fill(-1);
    qfront.fill(-1);
    qlinks.fill(-1);
    qback.fill(-1);

    long long total = 0;

    for(int i = 0; i < S.size(); i++)
    {
        int sn = abs(S[i]);

        starts[i] = S[i] > 0;
        
        if(qfront[sn] == -1)
        {
            //Create queue
            qfront[sn] = i;
            qback[sn] = i;
            put(i, 1);
        }
        else if(S[qfront[sn]] == S[i])
        {
            //Add to queue
            //cout << "QUEUE EXTENDED\n";
            qlinks[qback[sn]] = i;
            qback[sn] = i;
            put(i, 1);
        }
        else
        {
            //cout << "QFRONT: " << qfront[sn] << "\n";
            linked[qfront[sn]] = i;
            //if(qfront[sn] < 100) cout << "LINKED at " << qfront[sn] << ": " << linked[qfront[sn]] << "\n";
            total += i - qfront[sn];
            //cout << "ADD: " << (i - qfront[sn]) << "\n";
            if(!starts[qfront[sn]])
            {
                //cout << "NOT STARTS\n";
                total--;
            }

            qfront[sn] = qlinks[qfront[sn]];
            put(i, -1);
        }
    }

    //cout << "TOTAL PRE PROCESS: " << total << "\n";

    for(int ind = 0; ind < S.size(); ind++)
    {
        if(segTree[MAXN + ind] == 0) continue;

        int helps = qry(ind, linked[ind]);
        //if(ind < 100) cout << "HELPS from " << ind << " to " << linked[ind] << ": " << helps << "\n";
        total -= helps;

        put(ind, 0);
        put(linked[ind], 0);
    }
    
    return total;
}

/*
int main()
{
    //ifstream in("shoes.05.inp");
    
    int num;
    vector<int> vals;

    cin >> num;
    vals.resize(num);

    for(int i = 0; i < num; i++) cin >> vals[i];
    
    cout << count_swaps(vals) << "\n";

    
}*/

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6784 KB Output is correct
2 Correct 6 ms 6784 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6784 KB Output is correct
2 Correct 6 ms 6784 KB Output is correct
3 Correct 5 ms 6656 KB Output is correct
4 Correct 5 ms 6656 KB Output is correct
5 Correct 5 ms 6656 KB Output is correct
6 Correct 5 ms 6656 KB Output is correct
7 Correct 5 ms 6784 KB Output is correct
8 Correct 5 ms 6656 KB Output is correct
9 Correct 6 ms 6656 KB Output is correct
10 Correct 5 ms 6784 KB Output is correct
11 Correct 5 ms 6784 KB Output is correct
12 Correct 5 ms 6784 KB Output is correct
13 Correct 5 ms 6784 KB Output is correct
14 Correct 5 ms 6656 KB Output is correct
15 Correct 6 ms 6784 KB Output is correct
16 Correct 5 ms 6784 KB Output is correct
17 Correct 5 ms 6784 KB Output is correct
18 Correct 5 ms 6784 KB Output is correct
19 Correct 5 ms 6784 KB Output is correct
20 Correct 9 ms 7040 KB Output is correct
21 Correct 9 ms 7040 KB Output is correct
22 Correct 50 ms 9592 KB Output is correct
23 Correct 42 ms 9592 KB Output is correct
24 Correct 47 ms 9592 KB Output is correct
25 Correct 43 ms 9336 KB Output is correct
26 Correct 50 ms 9592 KB Output is correct
27 Correct 38 ms 9336 KB Output is correct
28 Correct 48 ms 9592 KB Output is correct
29 Correct 47 ms 9592 KB Output is correct
30 Correct 47 ms 9592 KB Output is correct
31 Correct 49 ms 9592 KB Output is correct
32 Correct 47 ms 9592 KB Output is correct
33 Correct 42 ms 9336 KB Output is correct
34 Correct 47 ms 9604 KB Output is correct
35 Correct 5 ms 6784 KB Output is correct
36 Correct 5 ms 6784 KB Output is correct
37 Correct 47 ms 9732 KB Output is correct
38 Correct 46 ms 9596 KB Output is correct
39 Correct 46 ms 9592 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6784 KB Output is correct
2 Correct 5 ms 6656 KB Output is correct
3 Correct 5 ms 6784 KB Output is correct
4 Correct 5 ms 6912 KB Output is correct
5 Correct 63 ms 9600 KB Output is correct
6 Correct 58 ms 9720 KB Output is correct
7 Correct 51 ms 9600 KB Output is correct
8 Correct 48 ms 9632 KB Output is correct
9 Correct 53 ms 9592 KB Output is correct
10 Correct 56 ms 9724 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6784 KB Output is correct
2 Correct 6 ms 6784 KB Output is correct
3 Correct 5 ms 6784 KB Output is correct
4 Correct 6 ms 6784 KB Output is correct
5 Correct 6 ms 6784 KB Output is correct
6 Correct 5 ms 6784 KB Output is correct
7 Correct 5 ms 6656 KB Output is correct
8 Correct 6 ms 6656 KB Output is correct
9 Correct 6 ms 6784 KB Output is correct
10 Correct 5 ms 6656 KB Output is correct
11 Correct 5 ms 6784 KB Output is correct
12 Correct 5 ms 6784 KB Output is correct
13 Correct 5 ms 6656 KB Output is correct
14 Correct 5 ms 6784 KB Output is correct
15 Correct 5 ms 6816 KB Output is correct
16 Correct 5 ms 6784 KB Output is correct
17 Correct 5 ms 6784 KB Output is correct
18 Correct 5 ms 6784 KB Output is correct
19 Correct 5 ms 6784 KB Output is correct
20 Correct 5 ms 6760 KB Output is correct
21 Correct 4 ms 6784 KB Output is correct
22 Correct 5 ms 6784 KB Output is correct
23 Correct 5 ms 6656 KB Output is correct
24 Correct 6 ms 6656 KB Output is correct
25 Correct 5 ms 6688 KB Output is correct
26 Correct 5 ms 6784 KB Output is correct
27 Correct 5 ms 6784 KB Output is correct
28 Correct 5 ms 6656 KB Output is correct
29 Correct 5 ms 6656 KB Output is correct
30 Correct 5 ms 6656 KB Output is correct
31 Correct 4 ms 6784 KB Output is correct
32 Correct 6 ms 6784 KB Output is correct
33 Correct 5 ms 6656 KB Output is correct
34 Correct 5 ms 6784 KB Output is correct
35 Correct 5 ms 6656 KB Output is correct
36 Correct 5 ms 6784 KB Output is correct
37 Correct 5 ms 6656 KB Output is correct
38 Correct 5 ms 6656 KB Output is correct
39 Correct 5 ms 6656 KB Output is correct
40 Correct 5 ms 6656 KB Output is correct
41 Correct 5 ms 6784 KB Output is correct
42 Correct 5 ms 6656 KB Output is correct
43 Correct 6 ms 6656 KB Output is correct
44 Correct 5 ms 6784 KB Output is correct
45 Correct 5 ms 6784 KB Output is correct
46 Correct 5 ms 6784 KB Output is correct
47 Correct 5 ms 6784 KB Output is correct
48 Correct 5 ms 6656 KB Output is correct
49 Correct 6 ms 6784 KB Output is correct
50 Correct 5 ms 6784 KB Output is correct
51 Correct 5 ms 6784 KB Output is correct
52 Correct 5 ms 6784 KB Output is correct
53 Correct 5 ms 6784 KB Output is correct
54 Correct 9 ms 7040 KB Output is correct
55 Correct 9 ms 7040 KB Output is correct
56 Correct 50 ms 9592 KB Output is correct
57 Correct 42 ms 9592 KB Output is correct
58 Correct 47 ms 9592 KB Output is correct
59 Correct 43 ms 9336 KB Output is correct
60 Correct 50 ms 9592 KB Output is correct
61 Correct 38 ms 9336 KB Output is correct
62 Correct 48 ms 9592 KB Output is correct
63 Correct 47 ms 9592 KB Output is correct
64 Correct 47 ms 9592 KB Output is correct
65 Correct 49 ms 9592 KB Output is correct
66 Correct 47 ms 9592 KB Output is correct
67 Correct 42 ms 9336 KB Output is correct
68 Correct 47 ms 9604 KB Output is correct
69 Correct 5 ms 6784 KB Output is correct
70 Correct 5 ms 6784 KB Output is correct
71 Correct 47 ms 9732 KB Output is correct
72 Correct 46 ms 9596 KB Output is correct
73 Correct 46 ms 9592 KB Output is correct
74 Correct 5 ms 6784 KB Output is correct
75 Correct 5 ms 6656 KB Output is correct
76 Correct 5 ms 6784 KB Output is correct
77 Correct 5 ms 6912 KB Output is correct
78 Correct 63 ms 9600 KB Output is correct
79 Correct 58 ms 9720 KB Output is correct
80 Correct 51 ms 9600 KB Output is correct
81 Correct 48 ms 9632 KB Output is correct
82 Correct 53 ms 9592 KB Output is correct
83 Correct 56 ms 9724 KB Output is correct
84 Correct 6 ms 6656 KB Output is correct
85 Correct 6 ms 6784 KB Output is correct
86 Correct 6 ms 6784 KB Output is correct
87 Correct 5 ms 6784 KB Output is correct
88 Correct 5 ms 6784 KB Output is correct
89 Correct 6 ms 6784 KB Output is correct
90 Correct 7 ms 6784 KB Output is correct
91 Correct 5 ms 6784 KB Output is correct
92 Correct 5 ms 6912 KB Output is correct
93 Correct 5 ms 6784 KB Output is correct
94 Correct 5 ms 6784 KB Output is correct
95 Correct 5 ms 6784 KB Output is correct
96 Correct 5 ms 6784 KB Output is correct
97 Correct 5 ms 6784 KB Output is correct
98 Correct 5 ms 6784 KB Output is correct
99 Correct 5 ms 6784 KB Output is correct
100 Correct 5 ms 6784 KB Output is correct
101 Correct 13 ms 7040 KB Output is correct
102 Correct 10 ms 7040 KB Output is correct
103 Correct 64 ms 9592 KB Output is correct
104 Correct 47 ms 9592 KB Output is correct
105 Correct 59 ms 9720 KB Output is correct
106 Correct 53 ms 9592 KB Output is correct
107 Correct 53 ms 9592 KB Output is correct
108 Correct 46 ms 9592 KB Output is correct
109 Correct 48 ms 9592 KB Output is correct
110 Correct 50 ms 9596 KB Output is correct
111 Correct 51 ms 9592 KB Output is correct
112 Correct 60 ms 9592 KB Output is correct
113 Correct 64 ms 9596 KB Output is correct
114 Correct 52 ms 9592 KB Output is correct
115 Correct 56 ms 9592 KB Output is correct