Submission #779506

#TimeUsernameProblemLanguageResultExecution timeMemory
779506Minindu206Arranging Shoes (IOI19_shoes)C++14
25 / 100
20 ms3108 KiB
#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll count_swaps(vector<int> s)
{
	ll n = s.size() / 2;
    if(n == 1)
        return s[0] > 0;
    int iseq = 1;
    for(int i=0;i<n;i++)
        if(s[i] + s[i + n] != 0)
        {
            iseq = 0;
            break;
        }
    if(iseq)
        return n * (n - 1) / 2;
    return n;
}
#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...