Submission #1242508

#TimeUsernameProblemLanguageResultExecution timeMemory
1242508duhendorfusArranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include <bits/stdc++.h>


using namespace std;
using ll = long long;


ll sub1(vector<int> S){
    if (S[0] < 0 && S[1] > 0) return 0;
    else return 1;
}


ll count_swaps(vector<int> S){
    int si = S.size() / 2;
    if (si == 1 && abs(S[0]) == abs(S[1])) return sub1(S);

    else 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...