제출 #765555

#제출 시각아이디문제언어결과실행 시간메모리
765555LudisseyArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms212 KiB
#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<signed> s) { if (s[0] > 0) { swap(s[0], s[1]); return 1LL; } else { return 0LL; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...