# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933834 | Pannda | IOI Fever (JOI21_fever) | C++17 | 1 ms | 600 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;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<array<int, 2>> a(n);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x *= 2;
y *= 2;
a[i] = {x, y};
}
// directions are 0.up 1.down 2.left 3.right
auto solve = [](int n, vector<array<int, 2>> a, int dir0) -> int {
map<int, set<array<int, 2>>> mp_hor, mp_ver, mp_up, mp_down;
for (int i = 1; i < n; i++) {
auto [x, y] = a[i];
mp_up[y - x].insert({x, i});
mp_down[y + x].insert({x, i});
mp_hor[y].insert({x, i});
mp_ver[x].insert({y, i});
}
priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> que;
vector<bool> vis(n, false);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |