# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331230 | pggp | Arranging Shoes (IOI19_shoes) | C++14 | 99 ms | 69760 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int sgn(int x){
if(x > 0 ) return 1;
return - 1;
}
long long count_swaps(vector < int > S){
// Najpierw przenumerowanie
set < int > sizes_set;
vector < int > sizes_original;
map < int, int > map_sizes;
bool b = true;
for (int i = 0; i < S.size()/2; ++i)
{
if(S[i] != -S[i + S.size()/2] or S[i] > 0){
b = false;
}
}
if(b){
long long n = S.size()/2;
return n * (n - 1) / 2;
}
// Na początku zamiany wewnętrzne
long long interial = 0;
stack < int > size_stack[S.size()/2 + 1];
for (int i = 0; i < S.size(); ++i)
{
if(size_stack[abs(S[i])].empty()){
size_stack[abs(S[i])].push(S[i]);
}
else{
if(S[i] < 0){
if(size_stack[abs(S[i])].top() > 0){
interial += size_stack[abs(S[i])].size();
size_stack[abs(S[i])].pop();
}
else{
size_stack[abs(S[i])].push(S[i]);
}
}
else{
if(size_stack[S[i]].top() < 0){
interial += size_stack[S[i]].size() - 1;
size_stack[S[i]].pop();
}
else{
size_stack[S[i]].push(S[i]);
}
}
}
}
long long exterial = 0;
return interial + exterial;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |