Submission #765554

#TimeUsernameProblemLanguageResultExecution timeMemory
765554LudisseyArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms304 KiB
#include "shoes.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream> 

using namespace std;

long long count_swaps(std::vector<int> s) {
    if (s[0] > 0) {
        swap(s[0], s[1]);
        return 1LL;
    }
    else {
        return 0LL;
    }
}
#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...