Submission #1274026

#TimeUsernameProblemLanguageResultExecution timeMemory
1274026almazArranging Shoes (IOI19_shoes)C++20
50 / 100
1096 ms1964 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; // #define int long long // #define endl '\n' #define ff first #define ss second #define pb push_back #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ar array const int MOD = 1e9 + 7, N = 2e5 + 5; long long INF = 1e18; long long count_swaps(std::vector<int> s) { int n = s.size(); long long ans = 0; for(int i = 0;i < n;i += 2){ if(s[i] < 0){ for(int j = i + 1;j < n;j++){ if(s[j] > 0 && s[j] == -s[i]){ while(j != i + 1){ swap(s[j] , s[j - 1]); j--; ans++; } break; } } } if(s[i] > 0){ for(int j = i + 1;j < n;j++){ if(s[j] < 0 && -s[j] == s[i]){ while(j != i){ swap(s[j] , s[j - 1]); j--; ans++; } break; } } } } return ans; }
#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...