제출 #196973

#제출 시각아이디문제언어결과실행 시간메모리
196973BasilhijazArranging Shoes (IOI19_shoes)C++14
0 / 100
2 ms256 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
    int cnt = 0; long long swaps = 0;
    for(int i = 0; i < s.size(); i++){
        if(s[i] < 0){
            swaps += abs(i - (cnt * 2));
            for(int j = 0; j < s.size(); j++){
                if(s[j] == s[i]*-1){
                    swaps += abs((cnt+1)*2 - j);
                }
                /*if(i > j){
                    if((cnt+1)*2 > j){
                        swaps--;
                    }
                    else{
                        swaps++;
                    }
                }
                /**/
            }
            cnt++;
        }
    }
	return swaps;
}

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

shoes.cpp:21:17: warning: "/*" within comment [-Wcomment]
                 /**/
                  
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:6:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < s.size(); i++){
                    ~~^~~~~~~~~~
shoes.cpp:9:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < s.size(); j++){
                            ~~^~~~~~~~~~
#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...