# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089027 | LilPluton | Building Skyscrapers (CEOI19_skyscrapers) | C++14 | 25 ms | 5072 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 ll
#define ll long long
const int inf = 1e9 + 7;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int sz = 2e5 + 5;
bool isadj(pair<int,int>& a, pair<int,int>& b){
int x1 = a.first;
int x2 = b.first;
int y1 = a.second;
int y2 = b.second;
if(x1 == x2){
return abs(y1 - y2) < 2;
}
if(y1 == y2){
return abs(x1 - x2) < 2;
}
int sum = abs(x1 - x2) + abs(y1 - y2);
return sum <= 2;
}
signed main(){
int n, t;
cin >> n >> t;
vector<pair<int,int>> a(n);
vector<pair<pair<int,int>, int>>v;
# | 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... |