# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
762252 | resting | Parking (CEOI22_parking) | C++17 | 541 ms | 33292 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 <bits/stdc++.h>
using namespace std;
#define int long long
const int mx = 1e5 + 5;
void solve() {
int n, m; cin >> n >> m;
vector<vector<int>> v(m, vector<int>(2, 0));
vector<vector<int>> pos(n);
vector<int> empty;
vector<pair<int, int>> res;
for (int i = 0; i < m; i++) {
auto& x = v[i];
cin >> x[0] >> x[1]; x[0]--; x[1]--;
if (x[0] + 1) pos[x[0]].push_back(i);
if (x[1] + 1) pos[x[1]].push_back(i);
}
vector<int> vis(n, 0);
auto mov = [&](int x, int y) -> void {
res.push_back({ x, y });
if (v[x][1] + 1) {
if (v[y][0] + 1) swap(v[x][1], v[y][1]);
else swap(v[x][1], v[y][0]);
} else {
if (v[y][0] + 1) swap(v[x][0], v[y][1]);
else swap(v[x][0], v[y][0]);
}
# | 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... |