# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651057 | 600Mihnea | Stranded Far From Home (BOI22_island) | C++17 | 322 ms | 35572 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;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
int n,m;
cin>>n>>m;
vector<ll> s(n);
vector<int> t(n,-1);
vector<int> ord(n);
vector<vector<int>> bosses(n);
vector<vector<int>> g(n);
for (int i=0;i<n;i++) {
cin>>s[i];
ord[i]=i;
bosses[i]={i};
}
sort(ord.begin(),ord.end(),[&](int i,int j){return s[i]<s[j];});
for (int i=0;i<m;i++) {
int a,b;
cin>>a>>b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
function<int(int)>root=[&](int a){
if(t[a]==a){
# | 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... |