| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311276 | lizi14 | Arranging Shoes (IOI19_shoes) | C++20 | 13 ms | 1964 KiB |
#include "shoes.h"
#include <cstdio>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
//#include "shoes.h"
long long count_swaps(vector<int> s) {
long long n=s.size()/2;
if(n==1){
if(s[0]<0 && s[1]>0){
return 0;
}
else return 1;
}
long long cnt=0;
for(int i=0; i<n; i++){
if(!(abs(s[i])==s[i+n] && s[i]<0)){
return 0;
}
}
//if(cnt==n){
return (n*(n-1)/2);
// }
// return 0;
//return 1;
}| # | 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... | ||||
