제출 #1047382

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047382		NotLinux	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	0 ms	348 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
const long long inf = 1e18 + 7;
long long count_swaps(vector<int> s) {
	int n = sz(s) / 2;
	long long ans = inf;
	// cout << "n : " << n << endl;
	// for(auto itr : s)cout << itr << " ";cout << endl;
	if(n == 1){// 10 pts - n = 1
		ans = 0;
		if(s[0] > 0)ans++;
		return ans;
	}
	// if(n <= 8){// 20 pts - n <= 8
	// 	vector < int > shoes;
	// 	for(auto itr : s)if(itr > 0)shoes.push_back(itr);
	// 	sort(all(shoes));
	// 	vector < int > perm(n);
	// 	iota(all(perm) , 0);
	// 	do{	
	// 		long long locans = 0;
	// 		vector < int > news;
	// 		for(auto itr : perm){
	// 			news.push_back(-shoes[itr]);
	// 			news.push_back(shoes[itr]);
	// 		}
	// 		for(int i = 0;i<2*n;i++){
	// 			int cur = i+1;
	// 			while(s[cur] != news[cur])cur++;
	// 			locans += cur - i;
	// 			int tmp = news[i];
	// 			for(int j = i;j<cur;j++){
	// 				news[j] = news[j+1];
	// 			}	
	// 			news[cur] = tmp;
	// 		}
	// 		ans = min(ans , locans);
	// 	} while(next_permutation(all(perm)));
	// 	return ans;
	// }
	// set < int > ste;
	// for(auto itr : s){
	// 	ste.insert(abs(itr));
	// }
	// if(sz(ste) == 1){// 20 pts - all shoe sizes are same

	// }
	// else{// 15 pts - first n are left , rest are right and i = i+n

	// }
}

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^

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