oj.uz

Submission #315261

# Submission time Handle Problem Language Result Execution time Memory
315261 2020-10-22T07:14:21 Z mosiashvililuka City (JOI17_city) C++14
8 / 100
 238 ms 47392 KB 
#include<bits/stdc++.h>
#include "Encoder.h"
using namespace std;
const int N=250009;
int a,b,c,d,e,i,j,lf[250009],rg[250009],f[250009],tim;
vector <int> v[250009];
void dfs(int q, int w){
	tim++;
	lf[q]=rg[q]=tim;
	for(vector <int>::iterator it=v[q].begin(); it!=v[q].end(); it++){
		if((*it)==w) continue;
		dfs((*it),q);
		if(rg[q]<rg[(*it)]) rg[q]=rg[(*it)];
	}
}
void Encode(int n, int A[], int B[]){
	a=n;
	for(i=0; i<a-1; i++){
		v[A[i]+1].push_back(B[i]+1);
		v[B[i]+1].push_back(A[i]+1);
	}
	dfs(1,0);
	for(i=1; i<=a; i++) Code(i-1,lf[i]*N+rg[i]);
}
#include<bits/stdc++.h>
#include "Device.h"
using namespace std;
const int n=250009;
int l[4],r[4];
void InitDevice() {
    
}
bool anc(int q, int w){
	if(l[q]<=l[w]&&r[q]>=r[w]) return 1; else return 0;
}
int Answer(long long S, long long T) {
	swap(S,T);
    l[1]=S/n;r[1]=S%n;
    l[2]=T/n;r[2]=T%n;
    if(anc(1,2)) return 0;
    if(anc(2,1)) return 1;
    return 2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12544 KB Output is correct
2 Correct 5 ms 12544 KB Output is correct
3 Correct 5 ms 12544 KB Output is correct
4 Correct 4 ms 12544 KB Output is correct
5 Correct 5 ms 12544 KB Output is correct
6 Correct 4 ms 12544 KB Output is correct
7 Correct 4 ms 12544 KB Output is correct
8 Correct 4 ms 12544 KB Output is correct
9 Correct 4 ms 12544 KB Output is correct
10 Correct 4 ms 12544 KB Output is correct
11 Correct 5 ms 12544 KB Output is correct
12 Correct 5 ms 12544 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 20344 KB Output is correct - L = 175007000
2 Correct 216 ms 26608 KB Output is correct - L = 174756990
3 Correct 219 ms 26768 KB Output is correct - L = 175007000
4 Correct 218 ms 26608 KB Output is correct - L = 175007000
5 Incorrect 219 ms 47392 KB Wrong Answer [3]
6 Halted 0 ms 0 KB -