제출 #1311257

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

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#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...