Submission #926398

# Submission time Handle Problem Language Result Execution time Memory
926398 2024-02-12T21:47:00 Z amirhoseinfar1385 City (JOI17_city) C++17
18 / 100
321 ms 53576 KB
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>>adj;
vector<pair<int,int>>stf;
int timea=0;
void solve(int u,int par=-1){
	timea++;
	stf[u].first=timea;
	for(auto x:adj[u]){
		if(x!=par){
			solve(x,u);
		}
	}
	stf[u].second=timea;
}

void Encode(int N, int A[], int B[])
{
	adj.clear();
	stf.clear();
	adj.resize(N+1);
	stf.resize(N+1);
	timea=0;
	for (int i = 0; i < N-1; ++i) {
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	solve(0);
	for(int i=0;i<N;i++){
		Code(i,stf[i].first+(stf[i].second*(1ll<<19)));
	}
}
#include "Device.h"
#include<bits/stdc++.h>
using namespace std;

void InitDevice()
{
}

int Answer(long long S, long long T)
{
	pair<long long ,long long>stfs,stft;
	stfs.first=(((1<<19)-1)&S);
	stft.first=(((1<<19)-1)&T);
	S>>=19;
	T>>=19;
	stfs.second=S;
	stft.second=T;
	if(stft.first>=stfs.first&&stft.second<=stfs.second){
		return 1;
	}
	if(stfs.first>=stft.first&&stfs.second<=stft.second){
		return 0;
	}
	return 2;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4880 KB Output is correct
2 Correct 0 ms 4880 KB Output is correct
3 Correct 1 ms 4876 KB Output is correct
4 Correct 0 ms 4892 KB Output is correct
5 Correct 0 ms 4880 KB Output is correct
6 Correct 1 ms 4888 KB Output is correct
7 Correct 1 ms 5036 KB Output is correct
8 Correct 2 ms 4892 KB Output is correct
9 Correct 1 ms 4880 KB Output is correct
10 Correct 1 ms 4876 KB Output is correct
11 Correct 1 ms 4892 KB Output is correct
12 Correct 2 ms 4892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 124 ms 12680 KB Output is partially correct - L = 367002300
2 Partially correct 118 ms 19240 KB Output is partially correct - L = 366478011
3 Partially correct 133 ms 19488 KB Output is partially correct - L = 367002300
4 Partially correct 124 ms 19492 KB Output is partially correct - L = 367002300
5 Partially correct 255 ms 52672 KB Output is partially correct - L = 131072250000
6 Partially correct 284 ms 52452 KB Output is partially correct - L = 131072250000
7 Partially correct 258 ms 52596 KB Output is partially correct - L = 131072250000
8 Partially correct 321 ms 52292 KB Output is partially correct - L = 131072250000
9 Partially correct 271 ms 53344 KB Output is partially correct - L = 131072250000
10 Partially correct 225 ms 53524 KB Output is partially correct - L = 131072250000
11 Partially correct 246 ms 53576 KB Output is partially correct - L = 131072250000
12 Partially correct 247 ms 53420 KB Output is partially correct - L = 131072250000
13 Partially correct 237 ms 53120 KB Output is partially correct - L = 131072250000
14 Partially correct 251 ms 52596 KB Output is partially correct - L = 131072250000
15 Partially correct 121 ms 19692 KB Output is partially correct - L = 367002300
16 Partially correct 122 ms 19496 KB Output is partially correct - L = 367002300
17 Partially correct 122 ms 19488 KB Output is partially correct - L = 367002300
18 Partially correct 262 ms 52740 KB Output is partially correct - L = 131072250000
19 Partially correct 251 ms 52692 KB Output is partially correct - L = 131072250000
20 Partially correct 250 ms 52676 KB Output is partially correct - L = 131072250000
21 Partially correct 254 ms 52764 KB Output is partially correct - L = 131072250000
22 Partially correct 290 ms 52628 KB Output is partially correct - L = 131072250000
23 Partially correct 264 ms 52748 KB Output is partially correct - L = 131072250000
24 Partially correct 249 ms 52644 KB Output is partially correct - L = 131072250000
25 Partially correct 248 ms 52656 KB Output is partially correct - L = 131072250000
26 Partially correct 279 ms 52528 KB Output is partially correct - L = 131072250000
27 Partially correct 276 ms 52452 KB Output is partially correct - L = 131072250000