제출 #1196793

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