Submission #2242246

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;
 
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
 
#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
 
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;
 
int main(){
	int n,m;
	cin>>n>>m;
	int x=max(n,m);
	n=min(n,m);
	n=x-n;
	int ans=0;
	int dp[55]={};
	FOR(i,1,41)dp[i]=mod;
	FOR(i,0,41){
		dp[i+1]=min(dp[i]+1,dp[i+1]);
		dp[i+5]=min(dp[i]+1,dp[i+5]);
		dp[i+10]=min(dp[i]+1,dp[i+10]);
	}
	FORD(i,41,1){
		dp[i-1]=min(dp[i]+1,dp[i-1]);
		if(i<5)continue;
		dp[i-5]=min(dp[i]+1,dp[i-5]);
		if(i<10)continue;
		dp[i-10]=min(dp[i]+1,dp[i-10]);
	}
	cout<<dp[n]<<endl;
 
    return 0;
}

Submission Info

Judge Result