Submission #465359

#TimeUsernameProblemLanguageResultExecution timeMemory
465359aris12345678Arranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms204 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int mxN = 100005; ll count_swaps(vector<int> s) { int n = int(s.size()); if(n == 2) { if(s[0] > 0) return 1; return 0; } else { vector<int> neg, pos; for(int i = 0; i < n; i++) { if(s[i] < 0) neg.push_back(i); else pos.push_back(i); } ll ans = 0; for(int i = 0; i < n/2; i++) ans += abs(neg[i]-pos[i]-1); return ans; } assert(true); }
#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...