제출 #1196792

#제출 시각아이디문제언어결과실행 시간메모리
1196792amanthabandArranging Shoes (IOI19_shoes)C++20
10 / 100
26 ms2628 KiB
#include <cmath> #include <iostream> #include <vector> #include <string> #include <algorithm> #include "shoes.h" using namespace std; bool isvalid(vector<int> s){ if (s.size() == 2 && abs(s[0]) == s[1] && s[0] < s[1]) { return true; } return false; } long long count_swaps(vector<int> s) { int cnt = 0; if (isvalid(s)) { return cnt; } else { swap(s[0], s[1]); cnt++; return cnt; } }
#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...