Submission #1516419


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <cmath>
#include <memory.h>
#include <iomanip>
using namespace std;

#define maxn 3002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)
#define REP(i, r) for (int i=0; i<(int)r; ++i)
#define REPD(i, r) for (int i=(int)r-1; i>=0; --i)
#define fi first
#define se second
#define mk make_pair
#define nil NULL
#define y0 y902
#define y1 y232
#define x0 x92
#define x1 x899
#define next asdfa
#define sz size
#define Debug(X) {cerr << #X << " = " << X << '\n';}
#define PR(A, n) {cerr << #A << " = "; FOR(i, 1, n) cerr << A[i] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; REP(i, n) cerr << A[i] << ' '; cerr << '\n';}
typedef long long ll;
typedef double db;
typedef pair<db, db> dd;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int inf = 1e9;
const ll MOD = 1000000007;
template<class T> int getbit(T x, int pos) {return (x>>(pos-1)) & 1;}
template<class T> void turn_on(T &x, int pos) {x = x | ((T)1<<(pos-1));}
template<class T> void turn_off(T &x, int pos) {x = x & ~((T)1<<(pos-1));}
template<class T> T sqr(T a) {return a*a;}

int m, n;
ll f[maxn][maxn][2];

ll dp(int x, int i, bool ok) {
    if (x==0) ok = true;
    if (i==m+1) return ok;
    if (f[x][i][ok]>-1) return f[x][i][ok];
    f[x][i][ok] = 0;
    if (x>0) f[x][i][ok] = f[x][i][ok] + dp(x-1, i+1, ok) + dp(x, i+1, ok || x==1);
    if (n-x>0) f[x][i][ok] = f[x][i][ok] + dp(x, i+1, ok) + dp(x+1, i+1, ok);
    return f[x][i][ok];
}

int main() {
    //freopen("pilling.inp", "r", stdin);
    //freopen("", "w", stdout);
    //ios::sync_with_stdio(0); cin.tie(0);
    scanf("%d%d", &n, &m);
    ll res = 0;
    memset(f, -1, sizeof(f));
    FOR(i, 0, n)
        res = (res + dp(i, 1, false))%MOD;
    printf("%I64d", res);
}

Submission Info

Submission Time
Task D - Piling Up
User phong22kk11
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1951 Byte
Status WA
Exec Time 2108 ms
Memory 141440 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:64:24: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ll {aka long long int}’ [-Wformat=]
     printf("%I64d", res);
                        ^
./Main.cpp:59:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 2
TLE × 1
AC × 6
WA × 2
TLE × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt AC 36 ms 141056 KB
sample_02.txt AC 36 ms 141056 KB
sample_03.txt TLE 2104 ms 141312 KB
subtask_1_01.txt TLE 2104 ms 141056 KB
subtask_1_02.txt TLE 2104 ms 141184 KB
subtask_1_03.txt TLE 2104 ms 141312 KB
subtask_1_04.txt TLE 2104 ms 141184 KB
subtask_1_05.txt TLE 2104 ms 141312 KB
subtask_1_06.txt TLE 2104 ms 141312 KB
subtask_1_07.txt TLE 2104 ms 141312 KB
subtask_1_08.txt TLE 2104 ms 141184 KB
subtask_1_09.txt TLE 2104 ms 141312 KB
subtask_1_10.txt TLE 2104 ms 141312 KB
subtask_1_11.txt TLE 2104 ms 141312 KB
subtask_1_12.txt TLE 2104 ms 141184 KB
subtask_1_13.txt TLE 2104 ms 141312 KB
subtask_1_14.txt TLE 2104 ms 141312 KB
subtask_1_15.txt TLE 2104 ms 141184 KB
subtask_1_16.txt TLE 2108 ms 141312 KB
subtask_1_17.txt TLE 2104 ms 141184 KB
subtask_1_18.txt TLE 2104 ms 141184 KB
subtask_1_19.txt TLE 2104 ms 141440 KB
subtask_1_20.txt TLE 2104 ms 141312 KB
subtask_1_21.txt WA 36 ms 141184 KB
subtask_1_22.txt WA 36 ms 141312 KB
subtask_1_23.txt TLE 2104 ms 141184 KB
subtask_1_24.txt TLE 2104 ms 141312 KB
subtask_1_25.txt AC 36 ms 141056 KB
subtask_1_26.txt TLE 2104 ms 141312 KB
subtask_1_27.txt AC 36 ms 141056 KB