Submission #1077351

#TimeUsernameProblemLanguageResultExecution timeMemory
1077351IgnutArranging Shoes (IOI19_shoes)C++17
15 / 100
20 ms3164 KiB
// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll count_swaps(vector<int> S) {
    ll res = 0;
    int n = S.size();
    // for (int i = 0; i < n; i ++) {
    //     if (i % 2 == 0) {
    //         int j;
    //         for (j = i; j < n; j ++)
    //             if (S[j] < 0) 
    //                 break;
    //         while (j > i) {
    //             swap(S[j - 1], S[j]);
    //             j --;
    //             res ++;
    //         }
    //     }
    //     else {
    //         int j;
    //         for (j = i; j < n; j ++)
    //             if (S[j] == -S[i - 1])
    //                 break;
    //         while (j > i) {
    //             swap(S[j - 1], S[j]);
    //             j --;
    //             res ++;
    //         }
    //     }
    // }
    
    for (int sz = 1; sz <= n / 2; sz ++) {
        res += sz - 1;
    }
    return res;
}
#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...