제출 #952687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
952687		batsukh2006	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1096 ms	12024 KiB

shoes

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 

#include "shoes.h"
 
using namespace std;
 
long long count_swaps(vector<int> s){
    map<int,int> m;
    vector<int> res(s.size());
    for(int i=0,j=0; i<s.size(); i++){
        if(m[s[i]]==0){
            if(s[i]<0){
                res[j]=s[i];
                res[j+1]=-s[i];
            }else{
                res[j]=-s[i];
                res[j+1]=s[i];
            }
            j+=2;
            m[-s[i]]++;
        }else{
            m[s[i]]--;
        }
    }
    int i=0;
    long long ans=0;
    while(i<s.size()){
        int j=i;
        while(res[i]!=s[j]) j++;
        while(i<j){
            int t=s[j];
            s[j]=s[j-1];
            s[j-1]=t;
            j--;
            ans++;
        }
        i++;
    }
    return ans;
}
// signed main(){
// 	// freopen("hps.in", "r", stdin);
// 	// freopen("hps.out", "w", stdout);
// 	ios::sync_with_stdio(0);
// 	cin.tie(0);
// 	cout.tie(0);
	
// 	int t=1;
// 	// cin>>t;
// 	while(t--){
// 		cout<<endl;
// 	}
// 	return 0;
// }

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0,j=0; i<s.size(); i++){
      |                      ~^~~~~~~~~
shoes.cpp:44:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     while(i<s.size()){
      |           ~^~~~~~~~~

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