# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740223 | vjudge1 | Fountain Parks (IOI21_parks) | C++17 | 190 ms | 40380 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>
#define f first
#define s second
using namespace std;
const int maxn = 2e5 + 100;
int ord[maxn];
int used[maxn];
int sum;
vector<int>g[maxn];
void dfs(int v){
used[v] = 1;
sum++;
for(auto to: g[v]){
if(!used[to]) dfs(to);
}
}
int construct_roads(std::vector<int> x, std::vector<int> y){
int n = x.size();
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
vector<pair<int, int>>c[2];
for(int i=0; i<n; i++){
int num = 0;
if(x[i] == 4) num = 1;
c[num].push_back({y[i], i});
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... |