oj.uz

Submission #926401

# Submission time Handle Problem Language Result Execution time Memory
926401 2024-02-12T22:01:54 Z amirhoseinfar1385 City (JOI17_city) C++17
22 / 100
 329 ms 40076 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<<18)));
	}
}

#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<<18)-1)&S);
	stft.first=(((1<<18)-1)&T);
	S>>=18;
	T>>=18;
	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;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 12608 KB Output is correct - L = 183501500
2 Correct 124 ms 12388 KB Output is correct - L = 183239355
3 Correct 131 ms 12592 KB Output is correct - L = 183501500
4 Correct 133 ms 12412 KB Output is correct - L = 183501500
5 Partially correct 287 ms 39316 KB Output is partially correct - L = 65536250000
6 Partially correct 261 ms 39072 KB Output is partially correct - L = 65536250000
7 Partially correct 263 ms 39088 KB Output is partially correct - L = 65536250000
8 Partially correct 260 ms 38848 KB Output is partially correct - L = 65536250000
9 Partially correct 243 ms 39780 KB Output is partially correct - L = 65536250000
10 Partially correct 244 ms 40028 KB Output is partially correct - L = 65536250000
11 Partially correct 243 ms 40076 KB Output is partially correct - L = 65536250000
12 Partially correct 231 ms 39936 KB Output is partially correct - L = 65536250000
13 Partially correct 258 ms 39716 KB Output is partially correct - L = 65536250000
14 Partially correct 289 ms 39252 KB Output is partially correct - L = 65536250000
15 Correct 124 ms 12504 KB Output is correct - L = 183501500
16 Correct 157 ms 12452 KB Output is correct - L = 183501500
17 Correct 121 ms 12548 KB Output is correct - L = 183501500
18 Partially correct 261 ms 39604 KB Output is partially correct - L = 65536250000
19 Partially correct 269 ms 39324 KB Output is partially correct - L = 65536250000
20 Partially correct 288 ms 39308 KB Output is partially correct - L = 65536250000
21 Partially correct 276 ms 39368 KB Output is partially correct - L = 65536250000
22 Partially correct 271 ms 39332 KB Output is partially correct - L = 65536250000
23 Partially correct 251 ms 39304 KB Output is partially correct - L = 65536250000
24 Partially correct 246 ms 39092 KB Output is partially correct - L = 65536250000
25 Partially correct 329 ms 39468 KB Output is partially correct - L = 65536250000
26 Partially correct 284 ms 39052 KB Output is partially correct - L = 65536250000
27 Partially correct 300 ms 38988 KB Output is partially correct - L = 65536250000