oj.uz

Submission #675630

# Submission time Handle Problem Language Result Execution time Memory
675630 2022-12-27T14:06:46 Z sudheerays123 Temperature (POI11_tem) C++17
8 / 100
 251 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;
 
void solve(){
 
	ll n;
	cin >> n;
 
	vector<pair<ll,ll>> range(n+5);
	for(ll i = 1; i <= n; i++) cin >> range[i].first >> range[i].second;

	ll maxi = -INF;
	for(ll i = 1; i <= n; i++){
		if(maxi > range[i].second) maxi = range[i].first;
		else maxi = max(maxi,range[i].first);
		range[i].first = maxi;
	}
 	
 	ll mini = INF;
 	for(ll i = n; i >= 1; i--){
 		if(mini < range[i].first) mini = range[i].second;
 		else mini = min(mini,range[i].second);
 		range[i].second = mini;
 	}

	vector<vector<ll>> dp(n+5,vector<ll>(3));
 
	dp[1][1] = 1;
	dp[1][2] = 1;
	ll ans = 1;
 
	for(ll i = 2; i <= n; i++){
 
		dp[i][1] = 1;
		dp[i][2] = 1;
 
		if(range[i-1].first <= range[i].first) dp[i][1] = max(dp[i][1],dp[i-1][1]+1);
		if(range[i-1].second <= range[i].first) dp[i][1] = max(dp[i][1],dp[i-1][2]+1);
 
		if(range[i-1].first <= range[i].second) dp[i][2] = max(dp[i][2],dp[i-1][1]+1);
		if(range[i-1].second <= range[i].second) dp[i][2] = dp[i-1][2]+1;
 
		ans = max({ans,dp[i][1],dp[i][2]});
	}
 
	cout << ans << "\n";
}
 
int main(){
 
	fast;
 
	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();
 
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1104 KB Output is correct
2 Correct 3 ms 1228 KB Output is correct
3 Incorrect 3 ms 1236 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 85 ms 33168 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 164 ms 51920 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 210 ms 55696 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 251 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 206 ms 59976 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 139 ms 58184 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 135 ms 54736 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 190 ms 51324 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 178 ms 49292 KB Memory limit exceeded
2 Halted 0 ms 0 KB -