# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147390 | 2019-08-29T12:16:20 Z | mosiashvililuka | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; long long a,b,c,d,e,f[200009]; long long count_swaps(int[] S){ for(a=1; ; a++) if(S[a-1]==0) break; for(b=1; b<=a; b++) f[b]=S[b-1]; if(f[1]<0) return 0LL; else return 1LL; }