# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112907 | ntdaccode | Synchronization (JOI13_synchronization) | C++17 | 8067 ms | 64240 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<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define pb push_back
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M=1e6+10;
const int N=1e3+10;
const int mod=1e9+7;
int n,m,q;
namespace sub1
{
vector<ii> ke[M];
vector<int> Q[M];
bool dd[M];
void dfs(int u,int pre,int p) {
//cout << u <<" " << pre << " " << p << "\n";
dd[u] = true;
for(ii tmp : ke[u]) {
int v = tmp.first;
int idx = tmp.second;
if(v == p) continue;
int nxt = 0,tt = 0;
for(int i = 0; i < Q[idx].size(); i++) {
tt = 1 - tt;
if(tt && Q[idx][i] <= pre) {
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... |