제출 #1047315

#제출 시각아이디문제언어결과실행 시간메모리
1047315NotLinuxArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; #define sz(x) (int)x.size() #define all(x) x.begin(),x.end() long long count_swaps(vector<int> s) { int n = sz(s); long long ans = 0; if(n == 1){// 10 pts - n = 1 if(s[0] > 0)ans++; return ans; } // else if(n <= 8){// 20 pts - n <= 8 // } // set < int > ste; // for(auto itr : s){ // ste.insert(abs(itr)); // } // if(sz(ste) == 1){// 20 pts - all shoe sizes are same // } // else{// 15 pts - first n are left , rest are right and i = i+n // } }

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

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