제출 #900664

#제출 시각아이디문제언어결과실행 시간메모리
900664ozner77Arranging Shoes (IOI19_shoes)C++17
50 / 100
1091 ms3268 KiB
#include "shoes.h" #include <bits/stdc++.h> #include <vector> #include <iostream> #include <string> using namespace std; long long count_swaps(std::vector<int> s) { int e=s.size(); long long swaps=0; for(int i=0;i<e;i++){ if(s[i]>0){ swaps++; } for(int k=i+1;k<e;k++){ if(s[k]+s[i]==0){ swaps+=(k-(i+1)); s.erase(s.begin()+k); e=s.size(); break; } } } return swaps; }
#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...