# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481163 | glome | Arranging Shoes (IOI19_shoes) | C++17 | 1088 ms | 11204 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 "shoes.h"
#include<bits/stdc++.h>
using namespace std;
bool check(vector<int> s) {
for (int i = 0; i<s.size(); i+=2) {
if(s[i] > 0 || -s[i] != s[i+1]) {
return 0;
}
}
return 1;
}
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
bool jk = 1;
set<int> s2;
for (int i = 0; i<s.size(); i++) {
s2.insert(s[i]);
}
if(s2.size() != 2) {
jk = 0;
}
if(s.size() <= 20000 || jk) {
long long ans = 0;
while(!check(s)) {
vector<int> news;
for (int i = 0; i<s.size(); i+=2) {
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... |