Submission #600636

#TimeUsernameProblemLanguageResultExecution timeMemory
600636nguyenTienArranging Shoes (IOI19_shoes)C++14
10 / 100
23 ms3088 KiB
#include <bits/stdc++.h>
#include <shoes.h>

using namespace std;

typedef long long ll;
#define fi first
#define se second

ll res = 0;

void sub1(vector <int>& v)
{
    if(v[0] < 0) res = 0;
    else res = 1;
}

long long count_swaps(std::vector<int> s) {
    int n = s.size() / 2;
    if(n == 1)
    {
        sub1(s);
        return res;
    }
	return 1;
}
#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...