Submission #204340

#TimeUsernameProblemLanguageResultExecution timeMemory
204340ADJAArranging Shoes (IOI19_shoes)C++14
10 / 100
5 ms376 KiB
#include "shoes.h" #include <iostream> #include <cstdio> #include <cstdlib> #include <vector> #include <set> #include <map> #include <algorithm> #include <bitset> #include <cmath> #include <queue> #include <stack> #include <string> #define sz(x) (int) x.size() #define all(x) x.begin(), x.end() using namespace std; vector<int> s; long long count_swaps(std::vector<int> S) { s = S; int result = 0; if (s[0] > 0) { result++; } return result; }
#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...