oj.uz

Submission #153393

# Submission time Handle Problem Language Result Execution time Memory
153393 2019-09-14T03:55:02 Z Dilshod_Imomov Arranging Shoes (IOI19_shoes) C++17
25 / 100
 1000 ms 2844 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;
        int sz1 = 0, sz2 = 0;
        For ( i, 0, n ) {
            if ( S[i] > 0 ) {
                ps.pb(i);
                sz1++;
            }
            else {
                ms.pb(i);
                sz2++;
            }
        }
        For ( i, 0, n ) {
            if ( sz2 && i >= ms[0] ) {
                ms.erase(ms.begin());
                sz2--;
            }
            if ( sz1 && i >= ps[0] ) {
                ps.erase(ps.begin());
                sz1--;
            }
            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++;
                    }
                    ps.erase(ps.begin());
                    sz1--;
                }
                else {
                    for ( int j = ms[0]; j > i; j-- ) {
                        swap(S[j], S[j - 1]);
                        cnt++;
                    }
                    ms.erase(ms.begin());
                    sz2--;
                }
                i++;
            }
        }
        return cnt;
    }
    For ( i, 0, n - 1 ) {
        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, 1, -1, -2};
    cout << count_swaps(S);
}
*/

Subtask #1
10.0 / 10.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

Subtask #2
0 / 20.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 256 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.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 256 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 348 KB Output is correct
7 Correct 2 ms 348 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 348 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 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 2 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 22 ms 632 KB Output is correct
21 Correct 22 ms 632 KB Output is correct
22 Execution timed out 1079 ms 2844 KB Time limit exceeded
23 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 5 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 31 ms 1884 KB Output is correct
6 Correct 31 ms 1916 KB Output is correct
7 Correct 31 ms 1912 KB Output is correct
8 Correct 30 ms 1912 KB Output is correct
9 Correct 31 ms 1912 KB Output is correct
10 Correct 31 ms 1912 KB Output is correct

Subtask #5
0 / 20.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 256 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
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 256 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -