# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084627 | SulA | Text editor (CEOI24_editor) | C++17 | 83 ms | 24972 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;
void subtask_1_2(int n) {
pair<int,int> start, end;
cin >> start.first >> start.second >> end.first >> end.second;
int l[n+1]; for (int i = 1; i <= n; i++) {
cin >> l[i];
l[i]++;
}
int dist[n+1][5002];
bool vis[n+1][5002] = {};
queue<pair<int,int>> q;
q.push(start);
vis[start.first][start.second] = true;
dist[start.first][start.second] = 0;
auto visit = [&](int to_x, int to_y, int from_x, int from_y) {
if (!vis[to_x][to_y]) {
dist[to_x][to_y] = dist[from_x][from_y] + 1;
vis[to_x][to_y] = true;
q.emplace(to_x, to_y);
}
};
while (!q.empty()) {
auto [x, y] = q.front();
q.pop();
# | 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... |