oj.uz

Submission #6076

# Submission time Handle Problem Language Result Execution time Memory
6076 2014-06-19T06:00:18 Z leecs0503 쌍둥이 독수리 (GA7_twineagles) C++
29 / 100
 0 ms 1088 KB 
#include<stdio.h>


//FILE *input=freopen("input.txt","r",stdin);

long long int swap(long long int &a,long long int &b){
	long long int c;
	c=a;
	a=b;
	b=c;
}

int main(){
	long long int lh,s,e,l,b;
	long long int olh,ols,ole,oll,olb;
	long long int cnt=0,cnt2;
	long long int k;
	long long int first;
	scanf("%lld%lld%lld%lld%lld",&lh,&s,&e,&l,&b);
	olh=lh;
	ols=s;
	ole=e;
	oll=l;
	olb=b;

	lh=olh;
	s=ols;
	e=ole;
	l=oll;
	lh=olh;
	cnt=0;
	cnt2=0;
	//l>=b
	if(s<=lh&&e<=lh){
		cnt=1;
	}
	else{
	if(lh*2<l&&s<lh*2){
		s=0;
		cnt=1;
		e+=b;
	}
	else{
	k=lh*2-l;
	if(s>lh*2)
	{
		cnt=(s-lh*2)/k;
		s-=cnt*k;
		e+=cnt*b;
		if(s>lh*2){
			s-=k;
			cnt++;
			e+=b;
		}
	}
	else{
		cnt=0;
	}
	if(s==0){
	}
	else if(s<=lh){
		s=0;
		e-=lh;
		if(e>0)
			e+=b;
		cnt++;
	}
	else{
		s=0;
		cnt++;
		e+=b;
	}
	}
	k=lh*2-b;
	if(e>lh*2){
		cnt2=(e-lh*2)/k;
		cnt+=cnt2;
		e-=cnt2*k;
		if(e>lh*2){
			e-=k;
			cnt++;
		}
	}
	else{
	}
	if(e<=0){
	}
	else{
		cnt++;
	}
	}
	first=cnt;
	swap(l,b);
	swap(s,e);
	lh=olh;
	s=ols;
	e=ole;
	l=oll;
	lh=olh;
	cnt=0;
	cnt2=0;
	//l>=b
	if(s<=lh&&e<=lh){
		cnt=1;
	}
	else{
	if(lh*2<l&&s<lh*2){
		s=0;
		cnt=1;
		e+=b;
	}
	else{
	k=lh*2-l;
	if(s>lh*2)
	{
		cnt=(s-lh*2)/k;
		s-=cnt*k;
		e+=cnt*b;
		if(s>lh*2){
			s-=k;
			cnt++;
			e+=b;
		}
	}
	else{
		cnt=0;
	}
	if(s==0){
	}
	else if(s<=lh){
		s=0;
		e-=lh;
		if(e>0)
			e+=b;
		cnt++;
	}
	else{
		s=0;
		cnt++;
		e+=b;
	}
	}
	k=lh*2-b;
	if(e>lh*2){
		cnt2=(e-lh*2)/k;
		cnt+=cnt2;
		e-=cnt2*k;
		if(e>lh*2){
			e-=k;
			cnt++;
		}
	}
	else{
	}
	if(e<=0){
	}
	else{
		cnt++;
	}
	}
	if(first<cnt)
		printf("%lld",first);
	else
		printf("%lld",cnt);

	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct

Subtask #3
0.0 / 9.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 48.0

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