제출 #558125

#제출 시각아이디문제언어결과실행 시간메모리
558125imalcokArranging Shoes (IOI19_shoes)C++17
50 / 100
1082 ms3128 KiB
#include "shoes.h"
#include <iostream>

using namespace std;

long long count_swaps(std::vector<int> S){
    long long c = 0;
    for (int i = 0; i < S.size(); i+=2)
    {
        if (S[i] < 0){
            int j = i+1;
            while (S[j] != (-1)*S[i]) j++;
            for (int k = 0; k < j-i-1; k++)
            {
                int temp;
                temp = S[j-k-1];
                S[j-k-1] = S[j-k];
                S[j-k] = temp;
            }
            c += (long long)(j-i-1); 
        }
        else
        {
            int j = i+1;
            while(S[j] != (-1)*S[i]) j++;
            for (int k = 0; k < j-i; k++)
            {
                int temp;
                temp = S[j-k-1];
                S[j-k-1] = S[j-k];
                S[j-k] = temp;
            }
            c += (long long)(j-i);
        }
    }
    return c;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < S.size(); i+=2)
      |                     ~~^~~~~~~~~~
#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...