Submission #283554

#TimeUsernameProblemLanguageResultExecution timeMemory
283554test2Arranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms384 KiB
#include<bits/stdc++.h> #include "shoes.h" #include<ext/rope> #define I inline void using namespace __gnu_cxx ; using namespace std ; using ll = long long ; using ld = long double ; const int N = 3000 + 7 , mod = 1e9 + 7 ; // How interesting! int n; long long count_swaps(std::vector<int> s) { int n = (int) s.size() ; ll ret = 0 ; rope<int> shoes (n * 2 , 0) ; for(int i = 0 ;i < n;i ++){ shoes.mutable_reference_at(i) = s[i] ; } for(int i = 0 ;i < n; i+=2){ int pos = shoes.find(-s[i]) ; shoes.erase(pos , 1) ; shoes.erase(0 , 1) ; ret += pos - i - 1; if(s[i] > s[pos]){ ret++ ; } } 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...