Submission #618200

#TimeUsernameProblemLanguageResultExecution timeMemory
618200serizeArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms300 KiB
#include "shoes.h" #include <bits/stdc++.h> #include <cstdio> #include <cassert> using namespace std; typedef long long ll; long long count_swaps(std::vector<int> s) { int n = s.size(); if(n == 2){ if(s[0] < 0 and s[1] > 0) return 0; else return 1LL; } return 0; }
#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...