oj.uz

Submission #530847

# Submission time Handle Problem Language Result Execution time Memory
530847 2022-02-27T01:26:55 Z M1v1savva Arranging Shoes (IOI19_shoes) C++17
10 / 100
 1 ms 300 KB 
#include "shoes.h"
#include <bits/stdc++.h>

#define sz(x) (int)(x).size()
#define forn(i, x) for (int i = 0; i < (int)x; i++)
#define pb push_back
#define rforn(i, x) for (int i = (int)x - 1; i >= 0; i--)
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ff first
#define ss second

using namespace std;

template<class T>
void print(T a) {
    for (auto x : a)
        cout << x << ' ';
    cout << endl;
}

//signed main() {
    //freopen("test.txt", "r", stdin);

    // int n;
    // cin >> n;
    // vector<int> a(n * 2);
    // forn (i, n * 2)
    // 	cin >> a[i];
long long count_swaps(vector<int> S) {
	vector<int> a = S;
	int n = sz(a);

    map<int, int> scores;
    map<int, int> prev;

    long long ans = 0;
    forn (i, 2 * n) {
    	int val = a[i];
    	scores[abs(val)]++;

		if (scores[abs(val)] % 2 == 0) {
			ans += i - prev[abs(val)];
			if (val > 0)
				ans--;
		} else {
			prev[abs(val)] = i;
		}
    }
    return ans;
    //cout << ans << '\n';

    //return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 272 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 300 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -