# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
815049 | jajco | Jail (JOI22_jail) | C++17 | 5101 ms | 24244 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 <ios>
#include <vector>
#include <algorithm>
#include <functional>
#define REP(i, n) for (int i=0; i<n; ++i)
typedef std::vector <int> vi;
int main(){
int q;
scanf("%d", &q);
while (q--){
int n;
scanf("%d", &n);
std::vector <vi> pol(n+1, vi());
REP(i, n-1){ // wczytanie grafu
int p,k;
scanf("%d%d", &p, &k);
pol[p].emplace_back(k);
pol[k].emplace_back(p);
}
int m;
scanf("%d", &m);
vi pocz(m),kon(m),perm,pn(n+1, -1),kn(n+1, -1);
REP(i, m){ // wczytanie ziomow
scanf("%d%d", &pocz[i], &kon[i]);
pn[pocz[i]]=i,kn[kon[i]]=i;
}
std::vector <vi> dag(m, vi());
vi ile(m);
REP(k, m){ // generacja daga
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |