oj.uz

Submission #1069621

# Submission time Handle Problem Language Result Execution time Memory
1069621 2024-08-22T07:17:26 Z 김은성(#11131) Passport (JOI23_passport) C++17
40 / 100
 2000 ms 70916 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll KEY = 1.557e8;
const int INF = 1.557e8;
ll dp[2509][2509];
int lb[200009], rb[200009];
int n, minl[1<<19], maxr[1<<19];
void settree(int v, int l, int r){
	if(l==r){
		minl[v] = lb[l];
		maxr[v] = rb[l];
	}
	else{
		int mid = (l+r)/2;
		settree(2*v, l, mid);
		settree(2*v+1, mid+1, r);
		minl[v] = min(minl[2*v], minl[2*v+1]);
		maxr[v] = max(maxr[2*v], maxr[2*v+1]);
	}
}
int minquery(int v, int l, int r, int s, int e){
	if(e<l || r<s)
		return INF;
	if(s<=l && r<=e)
		return minl[v];
	int mid = (l+r)/2;
	return min(minquery(2*v, l, mid, s, e), minquery(2*v+1, mid+1, r, s, e));
}
int maxquery(int v, int l, int r, int s, int e){
	if(e<l || r<s)
		return -1;
	if(s<=l && r<=e)
		return maxr[v];
	int mid = (l+r)/2;
	return max(maxquery(2*v, l, mid, s, e), maxquery(2*v+1, mid+1, r, s, e));
}
int solve(int l, int r){
	if(l==1 && r==n)
		return 0;
	if(dp[l][r] != -1)
		return dp[l][r];
	int pl = minquery(1, 1, n, l, r), pr = maxquery(1, 1, n, l, r);
	//printf("l=%d r=%d pl=%d pr=%d\n",l, r, pl,pr);
	int ret = INF;
	if(pl < l)
		ret = min(ret, solve(pl, r) + 1);
	if(pr > r)
		ret = min(ret, solve(l, pr) + 1);
	for(int i=l; i<=r; i++){
		if(lb[i] < l && rb[i] > r)
			ret = min(ret, solve(lb[i], rb[i]) + 1);
	}
	return dp[l][r] = ret;
}
int main(){
	int q, t, i, j, k, x;
	scanf("%d", &n);
	for(i=1; i<=n; i++){
		scanf("%d %d", &lb[i], &rb[i]);
	}
	settree(1,1, n);
	scanf("%d", &q);
	memset(dp, -1, sizeof(dp));
	while(q--){
		scanf("%d", &x);
		int ans = solve(lb[x], rb[x]) + 1;
		if(ans >= INF/2)
			ans = -1;
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

passport.cpp: In function 'int main()':
passport.cpp:57:9: warning: unused variable 't' [-Wunused-variable]
   57 |  int q, t, i, j, k, x;
      |         ^
passport.cpp:57:15: warning: unused variable 'j' [-Wunused-variable]
   57 |  int q, t, i, j, k, x;
      |               ^
passport.cpp:57:18: warning: unused variable 'k' [-Wunused-variable]
   57 |  int q, t, i, j, k, x;
      |                  ^
passport.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
passport.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |   scanf("%d %d", &lb[i], &rb[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
passport.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |   scanf("%d", &x);
      |   ~~~~~^~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 55132 KB Output is correct
2 Correct 7 ms 55000 KB Output is correct
3 Correct 7 ms 55132 KB Output is correct
4 Correct 31 ms 55232 KB Output is correct
5 Correct 1086 ms 56536 KB Output is correct
6 Execution timed out 2075 ms 70916 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 55132 KB Output is correct
2 Correct 7 ms 55132 KB Output is correct
3 Correct 7 ms 55000 KB Output is correct
4 Correct 7 ms 55132 KB Output is correct
5 Correct 7 ms 55132 KB Output is correct
6 Correct 7 ms 55132 KB Output is correct
7 Correct 7 ms 55132 KB Output is correct
8 Correct 7 ms 55132 KB Output is correct
9 Correct 7 ms 55132 KB Output is correct
10 Correct 7 ms 55132 KB Output is correct
11 Correct 7 ms 55132 KB Output is correct
12 Correct 7 ms 55132 KB Output is correct
13 Correct 7 ms 54996 KB Output is correct
14 Correct 7 ms 55132 KB Output is correct
15 Correct 8 ms 55132 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 55132 KB Output is correct
2 Correct 7 ms 55132 KB Output is correct
3 Correct 7 ms 55000 KB Output is correct
4 Correct 7 ms 55132 KB Output is correct
5 Correct 7 ms 55132 KB Output is correct
6 Correct 7 ms 55132 KB Output is correct
7 Correct 7 ms 55132 KB Output is correct
8 Correct 7 ms 55132 KB Output is correct
9 Correct 7 ms 55132 KB Output is correct
10 Correct 7 ms 55132 KB Output is correct
11 Correct 7 ms 55132 KB Output is correct
12 Correct 7 ms 55132 KB Output is correct
13 Correct 7 ms 54996 KB Output is correct
14 Correct 7 ms 55132 KB Output is correct
15 Correct 8 ms 55132 KB Output is correct
16 Correct 14 ms 55132 KB Output is correct
17 Correct 28 ms 55132 KB Output is correct
18 Correct 260 ms 55132 KB Output is correct
19 Correct 16 ms 55232 KB Output is correct
20 Correct 1493 ms 55404 KB Output is correct
21 Correct 662 ms 55400 KB Output is correct
22 Correct 8 ms 55132 KB Output is correct
23 Correct 7 ms 55024 KB Output is correct
24 Correct 14 ms 55132 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 55132 KB Output is correct
2 Correct 7 ms 55132 KB Output is correct
3 Correct 7 ms 55000 KB Output is correct
4 Correct 7 ms 55132 KB Output is correct
5 Correct 7 ms 55132 KB Output is correct
6 Correct 7 ms 55132 KB Output is correct
7 Correct 7 ms 55132 KB Output is correct
8 Correct 7 ms 55132 KB Output is correct
9 Correct 7 ms 55132 KB Output is correct
10 Correct 7 ms 55132 KB Output is correct
11 Correct 7 ms 55132 KB Output is correct
12 Correct 7 ms 55132 KB Output is correct
13 Correct 7 ms 54996 KB Output is correct
14 Correct 7 ms 55132 KB Output is correct
15 Correct 8 ms 55132 KB Output is correct
16 Correct 14 ms 55132 KB Output is correct
17 Correct 28 ms 55132 KB Output is correct
18 Correct 260 ms 55132 KB Output is correct
19 Correct 16 ms 55232 KB Output is correct
20 Correct 1493 ms 55404 KB Output is correct
21 Correct 662 ms 55400 KB Output is correct
22 Correct 8 ms 55132 KB Output is correct
23 Correct 7 ms 55024 KB Output is correct
24 Correct 14 ms 55132 KB Output is correct
25 Correct 6 ms 55128 KB Output is correct
26 Correct 6 ms 55132 KB Output is correct
27 Correct 20 ms 55044 KB Output is correct
28 Correct 404 ms 55132 KB Output is correct
29 Execution timed out 2055 ms 55388 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 55132 KB Output is correct
2 Correct 7 ms 55000 KB Output is correct
3 Correct 7 ms 55132 KB Output is correct
4 Correct 31 ms 55232 KB Output is correct
5 Correct 1086 ms 56536 KB Output is correct
6 Execution timed out 2075 ms 70916 KB Time limit exceeded
7 Halted 0 ms 0 KB -