oj.uz

Submission #965380

# Submission time Handle Problem Language Result Execution time Memory
965380 2024-04-18T12:05:41 Z akacool445k Arranging Shoes (IOI19_shoes) C++14
10 / 100
 1 ms 348 KB 
#include <queue>
#include "shoes.h"

using namespace std;
long long count_swaps(vector<int> s) {
	long long n = s.size();
	long long ans = 0;
	queue<int> a[n / 2 + 1], b[n / 2 + 1];
	for (int i = 0; i < n; i++) {
		if (s[i] < 0) a[-s[i]].push(i);
		else b[s[i]].push(i);
	}

	vector<int> c(n, 1);
	for (int i = 0; i < n; i++) {
		if (c[i] == 0) continue;
		int ss = 0;
		int x = s[i];
		int j = i;
		if (x < 0) {
			int y = -x;
			j = b[y].front();
			b[y].pop();
			a[y].pop();
		} else {
			j = a[x].front();
			a[x].pop();
			b[x].pop();
		}
		for (int jj = i + 1; jj < j; jj++) {
			ss += c[jj];
		}
		c[j] = 0;
		if (x > 0) ans++;
	}
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 15.0

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