| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1291697 | goulthen | Arranging Shoes (IOI19_shoes) | C++20 | 1096 ms | 1964 KiB |
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i = a; i <= b; i++)
const int MAXN = 2e5+10;
int a[MAXN];
ll count_swaps(vector<int> s) {
ll ans = 0;
while (s.size() > 0) {
rep(i,1,s.size()-1) {
if(abs(s[i])==abs(s[0])) {
ans += i;
if(s[0] <0) ans--;
s.erase(s.begin()+i);
s.erase(s.begin());
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... | ||||
