제출 #779458

#제출 시각아이디문제언어결과실행 시간메모리
779458mindiyakArranging Shoes (IOI19_shoes)C++14
10 / 100
101 ms134908 KiB
#include "shoes.h"
#include <vector>
#include <deque>
#include <iostream>

#define pb push_back
#define mp make_pair
#define ll long long

using namespace std;

long long count_swaps(vector<int> s) {

	vector<deque<ll>> arr;
	ll ans  = 0;

	deque<ll> a;
	for(int i=0;i<200003;i++){
		arr.pb(a);
	}
	
	for(int i=0;i<s.size();i++){
		//cout << s[i] << " (" << 100001-s[i] << ") " << arr[100001-s[i]].size();
		if(arr[100001-s[i]].size() != 0){
			//cout << " yes - " << (i-arr[100001-s[i]][0]) << " ";
			if(s[i] > 0 and (i-arr[100001-s[i]][0]) == 1){
				ans -= 1;
			}
			ans += (i-arr[100001-s[i]][0]);
			arr[100001-s[i]].pop_front();
		}else{
			//cout << " no - " << s[i]+100001 << " ";
			arr[s[i]+100001].push_back(i);
		}
		//cout << ans << endl;
	}

	return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...