Submission #143904

#TimeUsernameProblemLanguageResultExecution timeMemory
143904RezwanArefin01Arranging Shoes (IOI19_shoes)C++17
10 / 100
287 ms269688 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; const int N = 2e5 + 10; deque<int> pos[N], neg[N]; int r[N], bit[N]; long long count_swaps(vector<int> s) { return s[0] > 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...