# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173076 | PagodePaiva | Fountain Parks (IOI21_parks) | C++20 | 16 ms | 33344 KiB |
#include<bits/stdc++.h>
#include "parks.h"
using namespace std;
const int N = 200010;
int n;
vector <int> g[5*N];
vector <pair <int, int>> pt;
vector<pair <int, int>> arestas;
vector <pair <int, int>> pontos[N][2];
map <pair <int, int>, int> ruas;
pair <int, int> inv_ruas[5*N];
int to[5*N];
int cor;
int mark[5*N];
int cnt;
void dfs(int v){
cnt++;
mark[v] = 1;
for(auto x : g[v]){
if(mark[x]) continue;
dfs(x);
}
return;
}
bool kuhn(int v){
for(auto x : g[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... |