# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283038 | 2020-08-25T09:01:13 Z | IWANTTOGETGOLDINIOI | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> #include <fstream> #include <queue> #include <deque> #include <iomanip> #include <cmath> #include <set> #include <stack> #include <map> #include <unordered_map> #include <shoes.h> #define FOR(i,n) for(int i=0;i<n;i++) #define FORE(i,a,b) for(int i=a;i<=b;i++) #define ll long long //#define int long long #define ld long double #define vi vector<int> #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define iii pair<ii,int> #define il pair<ll,ll> #define vv vector #define endl '\n' using namespace std; int count_swaps(vector <int> vc) { if(vc[0] == -vc[1]) { return 1; } else if (vc[0] == -vc[1]) { return 0; } else { return 2; } }