제출 #892725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
892725		Lincito_31	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1095 ms	3264 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long x=0;
long long count_swaps(vector<int> s) {
    int con=0;
    while(con<s.size()){
        int temp=s[con];
        if(temp==0){
            con++;
            continue;
        }
        if(temp<0){
            int cero=0;
            for(int i=con+1;i<s.size();i++){
                if(s[i]==0){
                    cero++;
                }
                if(s[i]==-temp){
                    x+=i-con-1-cero;
                    s[i]=0;
                    break;
                }
            }
            s[con]=0;
        }else{
            int cero=0;
            for(int i=con+1;i<s.size();i++){
                if(s[i]==0){
                    cero++;
                }
                if(s[i]==-temp){
                    x+=i-con-cero;
                    s[i]=0;
                    break;
                }
            }
            s[con]=0;
        }
        con++;
    }
	return x;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:7:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     while(con<s.size()){
      |           ~~~^~~~~~~~~
shoes.cpp:15:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |             for(int i=con+1;i<s.size();i++){
      |                             ~^~~~~~~~~
shoes.cpp:28:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             for(int i=con+1;i<s.size();i++){
      |                             ~^~~~~~~~~

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