oj.uz

답안 #102523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102523 2019-03-25T17:00:59 Z Nnandi Mobitel (COCI19_mobitel) C++14
0 / 130
 243 ms 66560 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxrs = 305;
const int maxme = 1005;
const ll mod = 1000000007LL;
ll dpkis[maxrs][maxrs][maxme];
ll dpnagy[maxrs][maxrs][maxme];
ll tab[maxrs][maxrs];
int r, s;
ll n, m;

int main()
{
    cin>>r>>s>>n;
    m = (ll)sqrt(n);

    for(int i=0;i<r;i++) {
        for(int j=0;j<s;j++) {
            cin>>tab[i][j];
        }
    }
    for(int c=1;c<=min(tab[0][0],m);c++) {
        dpkis[0][0][c] = 1LL;
    }

    for(int i=0;i<r;i++) {
        for(int j=0;j<s;j++) {
            for(int c=1;c<=m;c++) {
                int req = (int)max(1LL,(c + tab[i][j] - 1) / tab[i][j]);
                dpkis[i][j][c] += (i > 0 ? dpkis[i-1][j][req] : 0LL);
                dpkis[i][j][c] += (j > 0 ? dpkis[i][j-1][req] : 0LL);
                dpkis[i][j][c] %= mod;
            }
        }
    }
    for(int i=0;i<r;i++) {
        for(int j=0;j<s;j++) {
            for(int c=m;c>=0;c--) {
                if(i == 0 && j == 0 && n <= c) dpnagy[i][j][c] = 1LL;
                if(c * tab[i][j] > m) {
                    int prereq = (n+c-1) / c;
                    int req = (prereq + tab[i][j] - 1) / tab[i][j];
                    dpnagy[i][j][c] += (i > 0 ? dpkis[i-1][j][req] : 0LL);
                    dpnagy[i][j][c] += (j > 0 ? dpkis[i][j-1][req] : 0LL);
                    dpnagy[i][j][c] %= mod;
                }
                else {
                    int req = c * tab[i][j];
                    dpnagy[i][j][c] += (i > 0 ? dpnagy[i-1][j][req] : 0LL);
                    dpnagy[i][j][c] += (j > 0 ? dpnagy[i][j-1][req] : 0LL);
                    dpnagy[i][j][c] %= mod;
                }
            }
        }
    }
    cout<<dpnagy[r-1][s-1][1]<<endl;
    return 0;
}

Subtask #1
0 / 130.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 105 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 101 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Runtime error 204 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Runtime error 211 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Runtime error 219 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 228 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 196 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 230 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 243 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 218 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)