oj.uz

Submission #305974

# Submission time Handle Problem Language Result Execution time Memory
305974 2020-09-24T08:15:26 Z tengiz05 Arranging Shoes (IOI19_shoes) C++17
0 / 100
 30 ms 1920 KB 
#include "shoes.h"
using namespace std;
long long count_swaps(vector<int> a) {
	int n = a.size()/2;n--;
	long long ans = 0;
	ans = n*(n+1)/2;
	/*for(int i=0;i<n;i++){
		if(a[i*2]+a[i*2+1] == 0){
			if(a[i*2] > 0){
				ans ++;
				swap(a[i*2], a[i*2+1]);
			}
			continue;
		}
		int j;
		for(j=i*2+1; j < n*2; j++){
			if(a[j] == -a[i*2]){ // found
				break;
			}
		}
		if(a[i*2] < 0){
			while(j-1 > i*2){
				j--;
				swap(a[j], a[j+1]);
				ans ++ ;
			}
		}else {
			while(j-1 >= i*2){
				j--;
				swap(a[j], a[j+1]);
				ans ++ ;
			}
		}
	}*/
	return ans;
}

/*

3
-2 2 2 -2 -2 2

2 
2 1 -1 -2

*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct