제출 #347983

#제출 시각아이디문제언어결과실행 시간메모리
347983ChaskaArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms364 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; int n; long long count_swaps(vector<int> s) { n = s.size()/2; int p =0; long long k=0; for (int i=0;i<n+n;i++) { if (s[i]<0) { k += i-p; p++; } } return k; }
#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...