# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143643 | 2019-08-14T19:39:20 Z | ignaciocanta | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define forsn(i, s, n) for(int i=s;i<int(n);i++) #define forn(i, n) forsn(i, 0, n) #define all(v) v.begin(), v.end() typedef long long tint; const int INF = 111000; int64 count_swaps(int[] S){ int n = S.size(); int cont = 0; forn(i, n){ if(S[i] < 0) cont++; } return cont; }