oj.uz

Submission #985899

# Submission time Handle Problem Language Result Execution time Memory
985899 2024-05-19T09:29:13 Z LucaIlie Arranging Shoes (IOI19_shoes) C++17
50 / 100
 69 ms 19304 KB 
#include "shoes.h"
#include <iostream>
#include <vector>
using namespace std;

#define nmax 200001
int v[nmax];
vector <int> fst[nmax], fdr[nmax];
int n;
int aint[4 * nmax];


void afiseaza( int node, int l, int r ) {
    ///cout << node << " " << l << " " << r << "   " << aint[node] << "\n";
    if( l == r )
        return;
    afiseaza( 2 * node, l, (l + r) / 2 );
    afiseaza( 2 * node + 1, (l + r) / 2 + 1, r );
}

int query( int node, int l, int r, int ql, int qr ) {
    if( r < ql || qr < l )
        return 0;
    if( ql <= l && r <= qr )
        return aint[node];
    return query( 2 * node, l, (l + r) / 2, ql, qr ) + query( 2 * node + 1, (l + r) / 2 + 1, r, ql, qr );
}

void update( int node, int l, int r, int qpoz, int val ) {
    if( r < qpoz || qpoz < l )
        return;
    if( l == r )
        aint[node] += val;
    else {
        update( 2 * node, l, (l + r) / 2, qpoz, val );
        update( 2 * node + 1, (l + r) / 2 + 1, r, qpoz, val );
        aint[node] = aint[2 * node] + aint[2 * node + 1];
    }
}
//vreau distanta intre doua pozitii
//un interval se muta mai la dreapta
/*int find_pair( int l ) {
    int i, j, rez = 0;
    if( v[l] < 0 ) {
        for( i = l + 1; i < n; i++ ) {
            if( v[i] + v[l] == 0 )
                break;
        }
        //toate pozitiile de la l la i cresc cu 1
        //rez = query( 1, 1, n, 1, n ) - query( 1, 1, n, 1, i );
        //update( 1, 1, n, i, 1 );
        //pozitia l si pozitia i
        v[i] = 0;
        return rez;
    } else if( v[j] > 0 ){
        for( i = l + 1; i < n; i++ ) {
            if( v[i] + v[l] == 0 )
                break;
        }
        for( j = i; j > l + 1; j-- )
            v[j] = v[j - 1];
        v[i] = 0;
        return i - l;
    }
    return 0;
}
*/
long long count_swaps( vector<int> s) {
    int i, l, rez = 0, j;
    n = s.size();
    for( i = 0; i < n; i++ )
        v[i] = s[i];
    for( i = n - 1; i >= 0; i-- ) {
        if( v[i] < 0 )
            fst[-v[i]].push_back( i );
        else
            fdr[v[i]].push_back( i );
    }
    for( l = 0; l < n; l ++ ) {
        if( v[l] == 0 )
            continue;
        if( v[l] < 0 ) {
            fst[-v[l]].pop_back();
            i = fdr[-v[l]].back();
            fdr[-v[l]].pop_back();
        } else {
            fdr[v[l]].pop_back();
            i = fst[v[l]].back();
            fst[v[l]].pop_back();
        }
        // toate poz de la l la i cresc cu 1
        ///cout << "i " << i << " l " << l << "\n";
        rez += i - l - 1 - ( query( 1, 1, n, 1, i ) - query( 1, 1, n, 1, l ) );
        if( v[l] > 0 )
            rez++;
        update( 1, 1, n, i, 1 );
        v[i] = 0;
        /*cout << "rez " << rez << "\n";
        cout << "aint\n";
        afiseaza( 1, 1, n );
        cout << "vector\n";
        for( j = 0; j < n; j++ )
            cout << v[j] << " ";
        cout << "\n";*/
    }
    return rez;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:69:24: warning: unused variable 'j' [-Wunused-variable]
   69 |     int i, l, rez = 0, j;
      |                        ^

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9816 KB Output is correct
3 Correct 4 ms 9788 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 10072 KB Output is correct
6 Correct 4 ms 9760 KB Output is correct
7 Correct 4 ms 9816 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9652 KB Output is correct
13 Correct 4 ms 9820 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 6 ms 9776 KB Output is correct
18 Correct 5 ms 9884 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 9 ms 10332 KB Output is correct
21 Correct 9 ms 10332 KB Output is correct
22 Correct 56 ms 15064 KB Output is correct
23 Correct 53 ms 16356 KB Output is correct
24 Correct 57 ms 16408 KB Output is correct
25 Incorrect 51 ms 15328 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 6 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Incorrect 69 ms 19304 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 4 ms 9816 KB Output is correct
2 Correct 4 ms 9816 KB Output is correct
3 Correct 4 ms 9820 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 4 ms 9732 KB Output is correct
11 Correct 6 ms 9820 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 4 ms 9820 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 6 ms 9816 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 4 ms 9816 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9820 KB Output is correct
22 Correct 5 ms 9816 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9768 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 4 ms 9820 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 4 ms 9820 KB Output is correct
34 Correct 4 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct
36 Correct 4 ms 9820 KB Output is correct
37 Correct 4 ms 10072 KB Output is correct
38 Correct 5 ms 9820 KB Output is correct
39 Correct 4 ms 9820 KB Output is correct
40 Correct 4 ms 9820 KB Output is correct
41 Correct 5 ms 9816 KB Output is correct
42 Correct 5 ms 9820 KB Output is correct
43 Correct 5 ms 9816 KB Output is correct
44 Correct 5 ms 9820 KB Output is correct
45 Correct 6 ms 9816 KB Output is correct
46 Correct 5 ms 9816 KB Output is correct
47 Correct 4 ms 9820 KB Output is correct
48 Correct 4 ms 9724 KB Output is correct
49 Correct 5 ms 9820 KB Output is correct
50 Correct 4 ms 9816 KB Output is correct
51 Correct 4 ms 9820 KB Output is correct
52 Correct 4 ms 9892 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9816 KB Output is correct
3 Correct 4 ms 9820 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 4 ms 9732 KB Output is correct
11 Correct 6 ms 9820 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 4 ms 9820 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 6 ms 9816 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 4 ms 9816 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 5 ms 9820 KB Output is correct
22 Correct 5 ms 9816 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9768 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 4 ms 9820 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9820 KB Output is correct
29 Correct 4 ms 9820 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 5 ms 9820 KB Output is correct
32 Correct 4 ms 9820 KB Output is correct
33 Correct 4 ms 9820 KB Output is correct
34 Correct 4 ms 9820 KB Output is correct
35 Correct 4 ms 9820 KB Output is correct
36 Correct 4 ms 9820 KB Output is correct
37 Correct 4 ms 9788 KB Output is correct
38 Correct 4 ms 9820 KB Output is correct
39 Correct 4 ms 10072 KB Output is correct
40 Correct 4 ms 9760 KB Output is correct
41 Correct 4 ms 9816 KB Output is correct
42 Correct 4 ms 9816 KB Output is correct
43 Correct 4 ms 9820 KB Output is correct
44 Correct 4 ms 9820 KB Output is correct
45 Correct 4 ms 9820 KB Output is correct
46 Correct 4 ms 9652 KB Output is correct
47 Correct 4 ms 9820 KB Output is correct
48 Correct 4 ms 9820 KB Output is correct
49 Correct 4 ms 9820 KB Output is correct
50 Correct 4 ms 9820 KB Output is correct
51 Correct 6 ms 9776 KB Output is correct
52 Correct 5 ms 9884 KB Output is correct
53 Correct 5 ms 9820 KB Output is correct
54 Correct 9 ms 10332 KB Output is correct
55 Correct 9 ms 10332 KB Output is correct
56 Correct 56 ms 15064 KB Output is correct
57 Correct 53 ms 16356 KB Output is correct
58 Correct 57 ms 16408 KB Output is correct
59 Incorrect 51 ms 15328 KB Output isn't correct
60 Halted 0 ms 0 KB -