# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831632 | Minindu206 | Fountain Parks (IOI21_parks) | C++17 | 551 ms | 43500 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 "parks.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
vector<int> adj[MAXN];
void dfs(int node, vector<int> &vis)
{
vis[node] = 1;
for(auto a:adj[node])
if(!vis[a])
dfs(a, vis);
}
int construct_roads(vector<int> x, vector<int> y)
{
int n = x.size();
map<pair<int, int>, int> ft;
for(int i=0;i<n;i++)
{
ft[{x[i], y[i]}] = i;
}
vector<pair<int, int>> dir{{2, 0}, {-2, 0}, {0, 2}, {0, -2}};
vector<int> u, v, a, b;
for(int i=0;i<n;i++)
{
for(auto d:dir)
{
int cx = x[i] + d.first, cy = y[i] + d.second;
if(!ft.count({cx, cy}))
Compilation message (stderr)
# | 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... |