| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290693 | Sofiatpc | Arranging Shoes (IOI19_shoes) | C++20 | 1095 ms | 1972 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
long long ans = 0;
for(int i = 0; i < s.size(); i+=2){
if(s[i] > 0){
for(int j = i+1; j < s.size(); j++)
if(s[j] == -s[i]){
for(int k = j-1; k >= i; k--){
swap(s[k],s[k+1]);
ans++;
}
break;
}
}else{
for(int j = i+1; j < s.size(); j++)
if(s[j] == -s[i]){
for(int k = j-1; k > i; k--){
swap(s[k],s[k+1]);
ans++;
}
break;
}
}
}
return ans;
}
| # | 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... | ||||
