Submission #318537

#TimeUsernameProblemLanguageResultExecution timeMemory
318537mohamedsobhi777City (JOI17_city)C++14
8 / 100
506 ms54072 KiB
#include <bits/stdc++.h> #include "Encoder.h" const int MAX = 5e5; using namespace std; vector<int> adj[MAX]; long long st[MAX], en[MAX], T; void dfs(int x, int p) { st[x] = ++T; for (auto u : adj[x]) { if (u == p) continue; dfs(u, x); } en[x] = ++T; Code(x, 1ll * st[x] * 1000000 + en[x]); } void Encode(int N, int A[], int B[]) { for (int i = 0; i < N - 1; ++i) { adj[A[i]].push_back(B[i]); adj[B[i]].push_back(A[i]); } dfs(0, 0); }
#include "Device.h" void InitDevice() { } int Answer(long long S, long long T) { long long s1 = S / 1000000, t1 = S % 1000000; long long s2 = T / 1000000, t2 = T % 1000000; if(s2>= s1 && t2 <= t1)return 1; if(s1 >= s2 && t1 <= t2) return 0; return 2; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...