# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062546 | Unforgettablepl | Port Facility (JOI17_port_facility) | C++17 | 6052 ms | 32856 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 long long
const int modulo = 1e9+7;
bool check_intersection(pair<int,int> a,pair<int,int> b) {
return (a.first<b.first and b.first<a.second and a.second<b.second)
or (b.first<a.first and a.first<b.second and b.second<a.second);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<pair<int,int>> ships(N);
for(auto&[a,b]:ships)cin>>a>>b;
vector<vector<int>> adj(N);
for(int u=0;u<N;u++) {
for(int v=u+1;v<N;v++) {
if(check_intersection(ships[u],ships[v])) {
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
}
}
int ans = 1;
vector<int> visited(N,-1);
# | 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... |