| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1189959 | h1440 | Arranging Shoes (IOI19_shoes) | C++20 | 14 ms | 1964 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
#define fore(i,a,b) for(lli i = (a), abcdxd = (b); i < abcdxd; i++)
#define sz(s) lli((s).size())
using namespace std;
typedef long long lli;
long long count_swaps(std::vector<int> s) {
lli id = 0, ans = 0;
fore(i,0,sz(s)) if (s[i] < 0){
ans += abs(id - i);
id += 2;
}
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... | ||||
