Submission #1405673
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) typedef long long ll; const int inf = 1e8; int main(){ int A, B; cin >> A >> B; if(A == B){ cout << 0 << endl; return 0; } A += 500; B += 500; int dp[50][2000]; FOR(i,0,50) FOR(j,0,2000) dp[i][j] = inf; dp[0][A] = 0; int v[6] = {1,5,10,-1,-5,-10}; FOR(i,0,49){ FOR(j,0,2000){ if(dp[i][j]==inf) continue; FOR(k,0,6){ if(j + v[k] < 0 || j + v[k] >= 2000) continue; dp[i+1][j+v[k]] = min(dp[i][j+v[k]], dp[i][j] + 1); } } } cout << dp[40][B] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - リモコン |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 904 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 640 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_maxdiff.txt, 00_maxret.txt, 00_sample1.txt, 00_sample2.txt, 00_sample3.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_maxdiff.txt | AC | 2 ms | 640 KB |
00_maxret.txt | AC | 2 ms | 640 KB |
00_sample1.txt | AC | 2 ms | 640 KB |
00_sample2.txt | AC | 2 ms | 640 KB |
00_sample3.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 2 ms | 640 KB |
01_rnd_01.txt | AC | 2 ms | 640 KB |
01_rnd_02.txt | WA | 2 ms | 640 KB |
01_rnd_03.txt | AC | 2 ms | 640 KB |
01_rnd_04.txt | AC | 2 ms | 640 KB |
01_rnd_05.txt | AC | 2 ms | 640 KB |
01_rnd_06.txt | AC | 2 ms | 640 KB |
01_rnd_07.txt | AC | 2 ms | 640 KB |
01_rnd_08.txt | AC | 2 ms | 640 KB |
01_rnd_09.txt | AC | 2 ms | 640 KB |
01_rnd_10.txt | AC | 2 ms | 640 KB |
01_rnd_11.txt | AC | 2 ms | 640 KB |
01_rnd_12.txt | AC | 2 ms | 640 KB |
01_rnd_13.txt | AC | 2 ms | 640 KB |
01_rnd_14.txt | AC | 2 ms | 640 KB |
01_rnd_15.txt | AC | 2 ms | 640 KB |
01_rnd_16.txt | AC | 2 ms | 640 KB |
01_rnd_17.txt | AC | 2 ms | 640 KB |
01_rnd_18.txt | AC | 2 ms | 640 KB |
01_rnd_19.txt | AC | 2 ms | 640 KB |
01_rnd_20.txt | WA | 2 ms | 640 KB |
01_rnd_21.txt | WA | 2 ms | 640 KB |
01_rnd_22.txt | AC | 2 ms | 640 KB |
01_rnd_23.txt | AC | 2 ms | 640 KB |
01_rnd_24.txt | AC | 2 ms | 640 KB |
01_rnd_25.txt | AC | 2 ms | 640 KB |
01_rnd_26.txt | AC | 2 ms | 640 KB |
01_rnd_27.txt | AC | 2 ms | 640 KB |
01_rnd_28.txt | AC | 2 ms | 640 KB |
01_rnd_29.txt | AC | 2 ms | 640 KB |