Submission #1045873

#TimeUsernameProblemLanguageResultExecution timeMemory
1045873Sputnik123Arranging Shoes (IOI19_shoes)C++17
25 / 100
25 ms3256 KiB
#include <bits/stdc++.h> #include "shoes.h" #define ll long long using namespace std; long long count_swaps(vector<int> s) { int n = s.size() / 2; if(n == 1) { if(s[0] < 0) return 0; else return 1; } ll ans = 0; for(ll i = 0; i < n ;i++) ans += i; return ans; }
#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...