oj.uz

답안 #922554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922554 2024-02-05T16:35:49 Z KiaRez Passport (JOI23_passport) C++17
48 / 100
 2000 ms 941488 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;
}

ll n, q, dist[3][5*N], vis[3][5*N], x[N], id[2*N], L[N], R[N], cnt;
vector<pll> adj[5*N];
vector<vector<int>> vec[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;
}

Compilation message

passport.cpp: In function 'int main()':
passport.cpp:90:19: warning: narrowing conversion of 'n' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   90 |  vec[0].pb({0, 1, n});
      |                   ^
passport.cpp:90:19: warning: narrowing conversion of 'n' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
passport.cpp:100:84: warning: narrowing conversion of '((dist[1][v.std::vector<int>::operator[](2)] + dist[0][v.std::vector<int>::operator[](2)]) - ((ll)((int)((v.std::vector<int>::operator[](2) > 1) && (((ll)v.std::vector<int>::operator[](2)) < n)))))' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
  100 |   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]});
      |                                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
passport.cpp:100:84: warning: narrowing conversion of '((dist[1][v.std::vector<int>::operator[](2)] + dist[0][v.std::vector<int>::operator[](2)]) - ((ll)((int)((v.std::vector<int>::operator[](2) > 1) && (((ll)v.std::vector<int>::operator[](2)) < n)))))' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
passport.cpp:103:49: warning: narrowing conversion of '(((long long int)v.std::vector<int>::operator[](0)) + it.std::pair<long long int, long long int>::second)' from 'long long int' to 'int' [-Wnarrowing]
  103 |    if(vis[v[1]][it.F]==0)vec[v[0]+it.S].pb({v[0]+it.S, v[1], it.F});
passport.cpp:103:49: warning: narrowing conversion of '(((long long int)v.std::vector<int>::operator[](0)) + it.std::pair<long long int, long long int>::second)' from 'long long int' to 'int' [-Wnarrowing]
passport.cpp:17:48: warning: narrowing conversion of 'it.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
   17 | #define F                                      first
      |                                                ^
passport.cpp:103:65: note: in expansion of macro 'F'
  103 |    if(vis[v[1]][it.F]==0)vec[v[0]+it.S].pb({v[0]+it.S, v[1], it.F});
      |                                                                 ^
passport.cpp:17:48: warning: narrowing conversion of 'it.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
   17 | #define F                                      first
      |                                                ^
passport.cpp:103:65: note: in expansion of macro 'F'
  103 |    if(vis[v[1]][it.F]==0)vec[v[0]+it.S].pb({v[0]+it.S, v[1], it.F});
      |                                                                 ^

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 76424 KB Output is correct
2 Correct 45 ms 76556 KB Output is correct
3 Correct 38 ms 76336 KB Output is correct
4 Execution timed out 2112 ms 941488 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 76324 KB Output is correct
2 Correct 39 ms 76364 KB Output is correct
3 Correct 38 ms 76376 KB Output is correct
4 Correct 45 ms 76412 KB Output is correct
5 Correct 37 ms 76376 KB Output is correct
6 Correct 47 ms 76360 KB Output is correct
7 Correct 44 ms 76492 KB Output is correct
8 Correct 41 ms 76568 KB Output is correct
9 Correct 45 ms 76380 KB Output is correct
10 Correct 44 ms 76368 KB Output is correct
11 Correct 47 ms 76796 KB Output is correct
12 Correct 43 ms 76632 KB Output is correct
13 Correct 45 ms 76892 KB Output is correct
14 Correct 42 ms 76628 KB Output is correct
15 Correct 47 ms 76672 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 76324 KB Output is correct
2 Correct 39 ms 76364 KB Output is correct
3 Correct 38 ms 76376 KB Output is correct
4 Correct 45 ms 76412 KB Output is correct
5 Correct 37 ms 76376 KB Output is correct
6 Correct 47 ms 76360 KB Output is correct
7 Correct 44 ms 76492 KB Output is correct
8 Correct 41 ms 76568 KB Output is correct
9 Correct 45 ms 76380 KB Output is correct
10 Correct 44 ms 76368 KB Output is correct
11 Correct 47 ms 76796 KB Output is correct
12 Correct 43 ms 76632 KB Output is correct
13 Correct 45 ms 76892 KB Output is correct
14 Correct 42 ms 76628 KB Output is correct
15 Correct 47 ms 76672 KB Output is correct
16 Correct 49 ms 81160 KB Output is correct
17 Correct 46 ms 78672 KB Output is correct
18 Correct 56 ms 79100 KB Output is correct
19 Correct 55 ms 79276 KB Output is correct
20 Correct 50 ms 77660 KB Output is correct
21 Correct 46 ms 77400 KB Output is correct
22 Correct 54 ms 78988 KB Output is correct
23 Correct 50 ms 79884 KB Output is correct
24 Correct 49 ms 79124 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 76324 KB Output is correct
2 Correct 39 ms 76364 KB Output is correct
3 Correct 38 ms 76376 KB Output is correct
4 Correct 45 ms 76412 KB Output is correct
5 Correct 37 ms 76376 KB Output is correct
6 Correct 47 ms 76360 KB Output is correct
7 Correct 44 ms 76492 KB Output is correct
8 Correct 41 ms 76568 KB Output is correct
9 Correct 45 ms 76380 KB Output is correct
10 Correct 44 ms 76368 KB Output is correct
11 Correct 47 ms 76796 KB Output is correct
12 Correct 43 ms 76632 KB Output is correct
13 Correct 45 ms 76892 KB Output is correct
14 Correct 42 ms 76628 KB Output is correct
15 Correct 47 ms 76672 KB Output is correct
16 Correct 49 ms 81160 KB Output is correct
17 Correct 46 ms 78672 KB Output is correct
18 Correct 56 ms 79100 KB Output is correct
19 Correct 55 ms 79276 KB Output is correct
20 Correct 50 ms 77660 KB Output is correct
21 Correct 46 ms 77400 KB Output is correct
22 Correct 54 ms 78988 KB Output is correct
23 Correct 50 ms 79884 KB Output is correct
24 Correct 49 ms 79124 KB Output is correct
25 Correct 41 ms 76372 KB Output is correct
26 Correct 39 ms 76492 KB Output is correct
27 Correct 48 ms 81204 KB Output is correct
28 Correct 51 ms 78648 KB Output is correct
29 Correct 47 ms 77652 KB Output is correct
30 Correct 47 ms 77556 KB Output is correct
31 Correct 54 ms 78688 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 76424 KB Output is correct
2 Correct 45 ms 76556 KB Output is correct
3 Correct 38 ms 76336 KB Output is correct
4 Execution timed out 2112 ms 941488 KB Time limit exceeded
5 Halted 0 ms 0 KB -