Submission #143901

#TimeUsernameProblemLanguageResultExecution timeMemory
143901RezwanArefin01Arranging Shoes (IOI19_shoes)C++17
0 / 100
279 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]; void update(int x) { for(++x; x > 0; x -= x & -x) ++bit[x]; } int read(int x) { int ret = 0; for(++x; x < N; x += x & -x) ret += bit[x]; return ret; } long long count_swaps(vector<int> s) { exit(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...