Submission #197395

#	Time	Username	Problem	Language	Result	Execution time	Memory
197395		Ahmed_Selim	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	24 ms	19580 KiB

shoes

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <algorithm>
#define MOD 1000000007
using namespace std;

long long int cvp, n;
vector<int> konum[2][200010];

long long int count_swaps(vector<int> S){
	for (n = 0; S[n] ; ++n){
		if(S[n]<0)konum[1][S[n]].push_back(n);
		else konum[0][S[n]].push_back(n);
	}
	for (int i = 0; i < n; i+=2){
		if(S[i]<0){
			int j=0;
			while(konum[0][S[i]][j]<0)j++;
			int index=konum[0][S[i]][j];
			while(index!=i+1){
				swap(S[index], S[index-1]);
				cvp++;
			}

			konum[0][S[i]][j]=-1;
		}else{
			int j=0;
			while(konum[0][S[i]][j]<0)j++;
			int index=konum[0][S[i]][j];
			while(index!=i+1){
				swap(S[index], S[index-1]);
				cvp++;
			}

			konum[0][S[i]][j]=-1;
			cvp++;

		}
	}

	return cvp;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:14:37: warning: array subscript is below array bounds [-Warray-bounds]
   if(S[n]<0)konum[1][S[n]].push_back(n);
             ~~~~~~~~~~~~~~~~~~~~~~~~^~~
shoes.cpp:20:26: warning: array subscript is below array bounds [-Warray-bounds]
    while(konum[0][S[i]][j]<0)j++;
                          ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15