제출 #890299

#제출 시각아이디문제언어결과실행 시간메모리
890299svazArranging Shoes (IOI19_shoes)C++14
0 / 100
0 ms348 KiB
#include "shoes.h" #include<iostream> #include<vector> using namespace std; long long count_swaps(std::vector<int> S){ vector<bool>visitados(S.size(),false); long long sw=0; bool enc=false; for(int i=0;i<S.size()-1;i++){ if((S[i]*-1)==S[i+1] ){ if(S[i]<0 && S[i+1]>0)enc=true; else sw++; if(i%2==0)i++; } else sw++; } if(!enc)sw++; return sw; } /*int main(){ int n,zap; cin>>n; vector<int>zapatos; for(int i=0;i<(n*2);i++){ cin>>zap; zapatos.push_back(zap); } cout<<count_swaps(zapatos)<<"\n"; return 0; }*/

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

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