Submission #465361

#TimeUsernameProblemLanguageResultExecution timeMemory
465361aris12345678Arranging Shoes (IOI19_shoes)C++14
25 / 100
24 ms3120 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int mxN = 100005;

ll count_swaps(vector<int> s) {
    int n = int(s.size());
    if(n == 2) {
        if(s[0] > 0)
            return 1;
        return 0;
    } else {
        n /= 2;
        n--;
        return 1LL*n*(n+1)/2;
    }
    assert(true);
}
#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...