oj.uz

Submission #922558

# Submission time Handle Problem Language Result Execution time Memory
922558 2024-02-05T16:37:53 Z KiaRez Passport (JOI23_passport) C++17
48 / 100
 2000 ms 885548 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, q, dist[3][5*N], vis[3][5*N], x[N], id[2*N], L[N], R[N], cnt;
vector<pii> adj[5*N];
vector<vector<int>> vec[3*N];

void build(int ind=1) {
	id[ind] = ++cnt;
	if(ind>=(1<<lg)) {
		int f = ind - (1<<lg) + 1;
		if(f<=n) adj[f].pb({id[ind], 0});
		return;
	}
	build(2*ind); build(2*ind+1);
	adj[id[2*ind+1]].pb({id[ind], 0});
	adj[id[2*ind]].pb({id[ind], 0});
}

void query(int v, int l, int r, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	if(l>=rc || lc>=r) return;
	if(lc>=l && rc<=r) {
		adj[id[ind]].pb({v, 1});
		return;
	}
	int mid = (lc+rc)/2;
	query(v, l, r, 2*ind, lc, mid);
	query(v, l, r, 2*ind+1, mid, rc);
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	cnt=n;
	for(int i=1; i<=n; i++) cin>>L[i]>>R[i];
	cin>>q;
	for(int i=1; i<=q; i++) cin>>x[i];

	build(1);
	for(int i=1; i<=n; i++) {
		query(i, L[i], i);
		query(i, i+1, R[i]+1);
	}

	int ptr = 0;
	//priority_queue<vector<int>, vector<vector<int>>, greater<vector<int>>> pq;
	//pq.push({0, 0, 1});
	//pq.push({0, 1, n});
	vec[0].pb({0, 0, 1});
	vec[0].pb({0, 1, n});
	while(ptr<N) {
		if(size(vec[ptr]) == 0) {
			ptr++; continue;
		}
		vector<int> v = vec[ptr].back();
		vec[ptr].pop_back();
		if(vis[v[1]][v[2]] == 1) continue;
		vis[v[1]][v[2]] = 1, dist[v[1]][v[2]] = v[0];
	if(vis[1][v[2]]==1 && vis[0][v[2]]==1) {
		vec[dist[1][v[2]]+dist[0][v[2]]-(v[2]>1&&v[2]<n)].pb({dist[1][v[2]]+dist[0][v[2]]-(v[2]>1&&v[2]<n), 2, v[2]});
	}
		for(auto it : adj[v[2]]) {
			if(vis[v[1]][it.F]==0)vec[v[0]+it.S].pb({v[0]+it.S, v[1], it.F});
		}
	}
	
	for(int i=1; i<=q; i++) {
		if(vis[2][x[i]] == 1) cout<<dist[2][x[i]]<<endl;
		else cout<<-1<<endl;
	}

	return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 84768 KB Output is correct
2 Correct 45 ms 84732 KB Output is correct
3 Correct 46 ms 84560 KB Output is correct
4 Execution timed out 2075 ms 885548 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 84568 KB Output is correct
2 Correct 50 ms 84564 KB Output is correct
3 Correct 40 ms 84768 KB Output is correct
4 Correct 41 ms 84568 KB Output is correct
5 Correct 46 ms 85252 KB Output is correct
6 Correct 42 ms 84780 KB Output is correct
7 Correct 43 ms 84560 KB Output is correct
8 Correct 42 ms 84564 KB Output is correct
9 Correct 39 ms 84612 KB Output is correct
10 Correct 44 ms 84752 KB Output is correct
11 Correct 42 ms 85080 KB Output is correct
12 Correct 44 ms 84820 KB Output is correct
13 Correct 44 ms 85056 KB Output is correct
14 Correct 41 ms 84828 KB Output is correct
15 Correct 45 ms 84712 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 84568 KB Output is correct
2 Correct 50 ms 84564 KB Output is correct
3 Correct 40 ms 84768 KB Output is correct
4 Correct 41 ms 84568 KB Output is correct
5 Correct 46 ms 85252 KB Output is correct
6 Correct 42 ms 84780 KB Output is correct
7 Correct 43 ms 84560 KB Output is correct
8 Correct 42 ms 84564 KB Output is correct
9 Correct 39 ms 84612 KB Output is correct
10 Correct 44 ms 84752 KB Output is correct
11 Correct 42 ms 85080 KB Output is correct
12 Correct 44 ms 84820 KB Output is correct
13 Correct 44 ms 85056 KB Output is correct
14 Correct 41 ms 84828 KB Output is correct
15 Correct 45 ms 84712 KB Output is correct
16 Correct 58 ms 88840 KB Output is correct
17 Correct 47 ms 86352 KB Output is correct
18 Correct 49 ms 86900 KB Output is correct
19 Correct 48 ms 86848 KB Output is correct
20 Correct 47 ms 85644 KB Output is correct
21 Correct 46 ms 85584 KB Output is correct
22 Correct 54 ms 86680 KB Output is correct
23 Correct 61 ms 87560 KB Output is correct
24 Correct 49 ms 87164 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 84568 KB Output is correct
2 Correct 50 ms 84564 KB Output is correct
3 Correct 40 ms 84768 KB Output is correct
4 Correct 41 ms 84568 KB Output is correct
5 Correct 46 ms 85252 KB Output is correct
6 Correct 42 ms 84780 KB Output is correct
7 Correct 43 ms 84560 KB Output is correct
8 Correct 42 ms 84564 KB Output is correct
9 Correct 39 ms 84612 KB Output is correct
10 Correct 44 ms 84752 KB Output is correct
11 Correct 42 ms 85080 KB Output is correct
12 Correct 44 ms 84820 KB Output is correct
13 Correct 44 ms 85056 KB Output is correct
14 Correct 41 ms 84828 KB Output is correct
15 Correct 45 ms 84712 KB Output is correct
16 Correct 58 ms 88840 KB Output is correct
17 Correct 47 ms 86352 KB Output is correct
18 Correct 49 ms 86900 KB Output is correct
19 Correct 48 ms 86848 KB Output is correct
20 Correct 47 ms 85644 KB Output is correct
21 Correct 46 ms 85584 KB Output is correct
22 Correct 54 ms 86680 KB Output is correct
23 Correct 61 ms 87560 KB Output is correct
24 Correct 49 ms 87164 KB Output is correct
25 Correct 38 ms 84776 KB Output is correct
26 Correct 43 ms 84800 KB Output is correct
27 Correct 54 ms 89096 KB Output is correct
28 Correct 49 ms 86480 KB Output is correct
29 Correct 49 ms 85604 KB Output is correct
30 Correct 50 ms 85612 KB Output is correct
31 Correct 50 ms 86748 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 84768 KB Output is correct
2 Correct 45 ms 84732 KB Output is correct
3 Correct 46 ms 84560 KB Output is correct
4 Execution timed out 2075 ms 885548 KB Time limit exceeded
5 Halted 0 ms 0 KB -