oj.uz

Submission #924103

# Submission time Handle Problem Language Result Execution time Memory
924103 2024-02-08T13:06:57 Z vjudge1 Advertisement 2 (JOI23_ho_t2) C++17
10 / 100
 115 ms 17608 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define imp(v) for(auto edu:v)cout<<edu.fst<<","<<edu.snd<<" "; cout<<"\n"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

int main(){FIN;
	ll n; cin>>n;
	vector<ii>a(n),b;
	fore(i,0,n)cin>>a[i].fst>>a[i].snd;
	sort(ALL(a));
	fore(i,0,n){
		if(SZ(b)&&b.back().fst==a[i].fst)b.pop_back();
		b.pb(a[i]);
	}
	// cout<<SZ(b)<<"\n"; //sb1
	a=b; n=SZ(a);
	ll p=0;
	fore(i,0,n)if(a[i].snd>a[p].snd)p=i;
	// imp(a);
	// cout<<p<<"\n";
	ll e=a[p].snd,d=a[p].fst;
	ll res=1;
	// cout<<"left\n";
	for(ll i=p-1;i>=0;i--){
		e-=abs(d-a[i].fst),d=a[i].fst;
		// cout<<i<<": "<<e<<" "<<a[i].snd<<"\n";
		if(e<a[i].snd)res++,e=a[i].snd;
	}
	e=a[p].snd,d=a[p].fst;
	// cout<<"right\n";
	fore(i,p+1,n){
		e-=abs(d-a[i].fst),d=a[i].fst;
		// cout<<i<<": "<<e<<" "<<a[i].snd<<"\n";
		if(e<a[i].snd)res++,e=a[i].snd;
	}
	cout<<res<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 29 ms 4664 KB Output is correct
3 Correct 41 ms 5328 KB Output is correct
4 Correct 99 ms 7688 KB Output is correct
5 Correct 58 ms 5464 KB Output is correct
6 Correct 114 ms 17608 KB Output is correct
7 Correct 115 ms 12488 KB Output is correct
8 Correct 105 ms 8284 KB Output is correct
9 Correct 81 ms 8284 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 29 ms 4664 KB Output is correct
3 Correct 41 ms 5328 KB Output is correct
4 Correct 99 ms 7688 KB Output is correct
5 Correct 58 ms 5464 KB Output is correct
6 Correct 114 ms 17608 KB Output is correct
7 Correct 115 ms 12488 KB Output is correct
8 Correct 105 ms 8284 KB Output is correct
9 Correct 81 ms 8284 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -