# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827917 | smatcsu | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> v;
void count_swaps(vector<int> v){
if(v[0]=(-v[1]) and v[0]<=0 and v[1]>=0) return 0;
else{
if(v[1]=(-v[0]) and v[1]<=0 and v[0]>=0) return 1;
else return -1;
}
}