# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047315 | NotLinux | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
long long count_swaps(vector<int> s) {
int n = sz(s);
long long ans = 0;
if(n == 1){// 10 pts - n = 1
if(s[0] > 0)ans++;
return ans;
}
// else if(n <= 8){// 20 pts - n <= 8
// }
// set < int > ste;
// for(auto itr : s){
// ste.insert(abs(itr));
// }
// if(sz(ste) == 1){// 20 pts - all shoe sizes are same
// }
// else{// 15 pts - first n are left , rest are right and i = i+n
// }
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |