# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092341 | raphaelp | Building Skyscrapers (CEOI19_skyscrapers) | C++14 | 344 ms | 18460 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 dfs(int x, vector<vector<int>> &AR, vector<int> &occ, int &nb)
{
if (occ[x])
return;
nb--;
occ[x] = 1;
for (int i = 0; i < AR[x].size(); i++)
{
dfs(AR[x][i], AR, occ, nb);
}
}
int main()
{
int N, T;
cin >> N >> T;
map<pair<int, int>, int> M;
vector<pair<int, int>> Tab;
vector<vector<int>> AR, AR2;
vector<pair<int, int>> trans1 = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}, trans2 = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};
int buff = 0;
for (int i = 0; i < N; i++)
{
int x, y;
cin >> x >> y;
Tab.push_back({x, y});
M[{x, y}] = buff++;
AR.push_back({});
AR2.push_back({});
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |