Submission #1325490

#TimeUsernameProblemLanguageResultExecution timeMemory
1325490x_aArranging Shoes (IOI19_shoes)C++20
10 / 100
1095 ms1948 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(vector<int> s) { int n = s.size(); int id = 0, ans = 0; while(id < n){ if(abs(s[id]) == abs(s[id + 1])){ if(s[id] > 0) ans ++; id += 2; continue; } int x = id + 1; for(int i = id + 1; i < n; i ++){ if(s[id] != s[i] && abs(s[id]) == abs(s[i])) { x = i; break; } ans ++; } for(int i = x - 1; i >= id + 1; i --){ swap(s[i + 1], s[i]); } } return ans; } // int main(){ // int n; cin >> n; // vector<int> s; // for(int i = 1, k; i <= 2 * n; i ++){ // cin >> k; // s.push_back(k); // } // cout << count_swaps(vector<int> s) << endl; // }
#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...