| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 765553 | Ludissey | Arranging Shoes (IOI19_shoes) | C++14 | 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 "shoes.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>
#define INF 9223372036854775801
#define int long long
#define LL (long long)
#define double long double
#define MOD(a) ((a) % 1000000007 + 1000000007 ) % 1000000007
#define FI first
#define caseOut(t) cout << "Case " << t << ": ";
#define SE second
#define USACO_SETUP() ifstream cin("paint.in"); ofstream cout("paint.out");
#define SETUP() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
long long count_swaps(std::vector<int> s) {
if (s[0] > 0) {
swap(s[0], s[1]);
return (long long)1;
}
else {
return (long long)0;
}
}