Submission #1233596

#TimeUsernameProblemLanguageResultExecution timeMemory
1233596sakkaArranging Shoes (IOI19_shoes)C++20
10 / 100
1096 ms1864 KiB
#include "shoes.h" #include <bits/stdc++.h> #define ll long long #define pb push_back #define fi first #define sec second #define pll pair<long long, long long> using namespace std; ll count_swaps(vector<int> s) { int sz = s.size(); ll ans = 0; for(int i=0; i<sz; i++){ if(i%2==0){ if(s[i]<0)continue; else{ int id = i+1; while(s[id]>0)id++; while(id>i){ ans++; swap(s[id],s[id-1]); id--; } } } else{ if(s[i]==s[i-1]*-1)continue; else{ int id = i+1; while(s[id]!=s[i-1]*-1) id++; while(id>i){ ans++; swap(s[id],s[id-1]); id--; } } } } return ans ; } /* g++ -std=gnu++14 -O2 -Wall -pipe -static -o "shoes" "grader.cpp" "shoes.cpp" */
#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...