제출 #341097

#제출 시각아이디문제언어결과실행 시간메모리
341097israeladewuyiArranging Shoes (IOI19_shoes)C++17
50 / 100
1091 ms3200 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<string> vs; #define PB push_back #define pb pop_back #define in insert #define endl "\n" const unsigned int M = 1000000007; ll count_swaps(vi a){ ll n = (int)a.size()/2, ans=0; while(n--){ int x = a[0], ind = 1; while(a[ind]!= -x) ind++; if(x<0) ans+=ind-1; else ans+=ind; a.erase(a.begin()+ind); a.erase(a.begin()); } return ans; return ans; } //int main(){ // vi v; // v.PB(-2); // v.PB(2); // v.PB(2); // v.PB(-2); // cout<<count_swaps(v); //}
#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...