제출 #155913

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

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define F first
#define S second
#define INF 10000000
#define inf -10000000
#define pb push_back
#define forr(i,p,n) for(int i=p;i<n;i++)
#define mp make_pair
#define upb(a,s) upper_bound(a.begin(),a.end(),s)
#define lwb(a,s) lower_bound(a.begin(),a.end(),s)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<ll> vi;
typedef vector<vi> vvi;

long long count_swaps(std::vector<int> s) {
  if(s.size()==2){
    if(s[0]<s[1])return 0;
    else return 1;
  }else{
    ll c=0;
  for(int i=0;i<s.size();i+=2){
    if(s[i]<0){
      int h=s[i]*-1;
      int k=0;
      for(int j=i+1;j<s.size();j++){
        if(h==s[j]){
            k=j;
            c+=abs(i+1-j);
            break;
        }
      }
      for(int j=k;j>i+1;j--){
        swap(s[j],s[j-1]);
      }
    }
    else{
      int h=s[i]*-1;
      int k=0;
      for(int j=i+1;j<s.size();j++){
	if(h==s[j]){
	  k=j;
	  c+=abs(i-j);
	  break;
	}
      }
      for(int j=k;j>i;j--){
        swap(s[j],s[j-1]);
      }
    }
    /*cout<<c<<endl;
    for(int i=0;i<s.size();i++){
        cout<<s[i]<<" ";
    }
    cout<<endl;*/
  }
  return c;
  }
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<s.size();i+=2){
               ~^~~~~~~~~
shoes.cpp:31:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j=i+1;j<s.size();j++){
                     ~^~~~~~~~~
shoes.cpp:45:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j=i+1;j<s.size();j++){
                     ~^~~~~~~~~

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