제출 #143412

#제출 시각아이디문제언어결과실행 시간메모리
143412gs14004Arranging Shoes (IOI19_shoes)C++17
0 / 100
2 ms376 KiB
#include "shoes.h" #include <bits/stdc++.h> #define sz(v) ((int)(v).size()) using lint = long long; lint count_swaps(std::vector<int> s) { lint ret = 0; for(int i=0; i<sz(s); i++){ if(s[i] < 0) ret += abs(s[i] - 2 * i); } return ret; }
#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...