oj.uz

Submission #153392

# Submission time Handle Problem Language Result Execution time Memory
153392 2019-09-14T03:40:34 Z Dilshod_Imomov Arranging Shoes (IOI19_shoes) C++17
65 / 100
 1000 ms 3196 KB 
# include <bits/stdc++.h>
# pragma GCC optimize("Ofast")
# define file
# define ll long long
# define fi first
# define se second
# define pb push_back
# define pf push_front
# define For(i, a, b) for( ll i = a; i < b; i++ )
# define in insert
# define all(a) a.begin(),a.end()
# define pi pair < ll, ll >
# define readfile(file) freopen ( (file + ".in").c_str(), "r", stdin)
# define writefile(file) freopen ( (file + ".out").c_str(), "w", stdout)
# define speed ios_base::sync_with_stdio(false);cin.tie(NULL)
# define SET(file) readfile(file);writefile(file);
# define LARGE 100005
using namespace std;

ll count_swaps( vector < int > S ) {
    ll cnt = 0;
    int n = S.size();
    ll c = 0;
    ll x = 0;
    For ( i, 0, n / 2 ) {
        if ( S[i] < 0 && S[i] != S[i + n / 2] && abs(S[i]) == abs(S[i + n / 2]) ) {
            c++;
        }
        if ( abs( S[i] ) == abs( S[i + n / 2] ) ) {
            x++;
        }
    }
    if ( c == n / 2 ) {
        ll ans = n / 2 - 1;
        ans *= n / 2;
        ans /= 2;
        return ans;
    }/*
    if ( x == n / 2 ) {
        vector < int > ms, ps;
        For ( i, 0, n ) {
            if ( S[i] > 0 ) ps.pb(i);
            else ms.pb(i);
        }
        For ( i, 0, n ) {
            if ( i > ms[0] ) ms.erase(ms.begin());
            if ( i > ps[0] ) ps.erase(ps.begin());
            if ( S[i] != S[i + 1] && abs(S[i]) == abs(S[i]) && S[i] < 0 ) {
                i++;
            }
            else {
                if ( S[i] < 0 ) {
                    for ( int j = ps[0]; j > i + 1; j-- ) {
                        swap( S[j], S[j - 1] );
                        cnt++;
                    }
                }
                else {
                    for ( int j = ms[0]; j > i; j-- ) {
                        swap(S[j], S[j - 1]);
                        cnt++;
                    }
                }
            }
        }
        return cnt;
    }*/
    For ( i, 0, n ) {
        if ( S[i] != S[i + 1] && abs(S[i]) == abs(S[i + 1]) && S[i] < 0 ) {
            i++;
        }
        else {
            For ( j, i + 1, n ) {
                if ( S[i] != S[j] && abs(S[i]) == abs(S[j]) ) {
                    for ( int k = j; k > i + 1; k-- ) {
                        swap( S[k], S[k - 1] );
                        cnt++;
                    }
                    if ( S[i] > 0 ) {
                        swap( S[i], S[i + 1] );
                        cnt++;
                    }
                    break;
                }
            }
            i++;
        }
    }
    return cnt;
}
/*
int main() {
    /// Author: _Dilshod_
    #ifdef file
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif // file
    speed;
    vector < int > S = {-2, 2, 2, -2, -2, 2};
    cout << count_swaps(S);
}
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 360 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 7 ms 632 KB Output is correct
21 Correct 6 ms 632 KB Output is correct
22 Correct 47 ms 3192 KB Output is correct
23 Correct 27 ms 3192 KB Output is correct
24 Correct 34 ms 3196 KB Output is correct
25 Execution timed out 1079 ms 2936 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 31 ms 1832 KB Output is correct
6 Correct 34 ms 1912 KB Output is correct
7 Correct 33 ms 1912 KB Output is correct
8 Correct 31 ms 2012 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 31 ms 2040 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 308 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 3 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 3 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 360 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 3 ms 376 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 3 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 7 ms 632 KB Output is correct
55 Correct 6 ms 632 KB Output is correct
56 Correct 47 ms 3192 KB Output is correct
57 Correct 27 ms 3192 KB Output is correct
58 Correct 34 ms 3196 KB Output is correct
59 Execution timed out 1079 ms 2936 KB Time limit exceeded
60 Halted 0 ms 0 KB -