제출 #1189959

#제출 시각아이디문제언어결과실행 시간메모리
1189959h1440Arranging Shoes (IOI19_shoes)C++20
45 / 100
14 ms1964 KiB
#include "shoes.h" #include <bits/stdc++.h> #define fore(i,a,b) for(lli i = (a), abcdxd = (b); i < abcdxd; i++) #define sz(s) lli((s).size()) using namespace std; typedef long long lli; long long count_swaps(std::vector<int> s) { lli id = 0, ans = 0; fore(i,0,sz(s)) if (s[i] < 0){ ans += abs(id - i); id += 2; } return ans; }
#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...