# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116054 | Arturgo | Synchronization (JOI13_synchronization) | C++14 | 4234 ms | 113644 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 <iostream>
#include <vector>
#include <set>
using namespace std;
int nbServers, nbEvents, nbReqs;
vector<int> voisins[100 * 1000];
vector<pair<int, int>> links;
int nbInfos[100 * 1000];
int derInfos[100 * 1000];
bool isConnected[100 * 1000];
int curId = 0;
int ids[100 * 1000], rIds[100 * 1000];
int curPos = 0;
int positions[100 * 1000];
void dfs(int noeud, int parent = -1) {
rIds[curId] = noeud;
ids[noeud] = curId++;
for(int voisin : voisins[noeud]) {
if(voisin != parent)
dfs(voisin, noeud);
}
positions[noeud] = curPos++;
# | 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... |