# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166923 | PagodePaiva | Keys (IOI21_keys) | C++20 | 805 ms | 8520 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N = 2010;
vector <pair <int, int>> g[N];
int tipo[N];
vector <int> talvez[N];
int mark[N];
int n, m;
int bfs(int v){
queue <int> q;
set <int> s;
s.insert(tipo[v]);
q.push(v);
memset(mark, 0, sizeof mark);
int cnt = 0;
while(!q.empty()){
auto v = q.front();
q.pop();
if(mark[v]) continue;
cnt++;
mark[v] = 1;
s.insert(tipo[v]);
while(!talvez[tipo[v]].empty()){
auto vv = talvez[tipo[v]].back();
talvez[tipo[v]].pop_back();
q.push(vv);
}
# | 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... |