oj.uz

Submission #369320

# Submission time Handle Problem Language Result Execution time Memory
369320 2021-02-21T09:57:11 Z Sparky_09 Mobitel (COCI19_mobitel) C++17
13 / 130
 6000 ms 8172 KB 
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;

int rd() {
	int result = 0;
	char ch;
	ch = getchar();
	while(ch < '0' || ch > '9') ch = getchar();
	result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	return result;
}

template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

void usaco(string s){
  freopen((s+".in").c_str(), "r", stdin);
  freopen((s+".out").c_str(), "w", stdout);
}

const int N = 300 + 3;
const int K = 3010;
int n, m, v, dp[2][N][K], a[N][N];
int cnt;
map<int, int> val, id;
inline int q(int a, int b){ 
    return int(ceil(1.0 * a / b));
}

void init(){
    for(int i = 1; i < v; i++){
        int tmp = q(v, i);

        if (id.count(tmp))
            continue;

        val[id[tmp] = cnt++] = tmp;
    }
}

const int mod = int(1e9) + 7;
void add(int &a, int &b) {
    a = (a + b) % mod;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
#ifdef LOCAL_DEFINE
	freopen("input.txt", "r", stdin);
#endif
    n = rd();
    m = rd();
    v = rd();
    init();

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            a[i][j] = rd();

    dp[0][1][id[v]] = 1;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++)
            for(int k = 0; k < cnt; k++)
                dp[i & 1][j][k] = 0;

        for(int j = 1; j <= m; j++)
            for(int k = 0; k < cnt; k++){
                int from = id[q(val[k], a[i][j])];
                add(dp[i & 1][j][from], dp[(i - 1) & 1][j][k]);

                if(j > 1)
                    add(dp[i & 1][j][from], dp[i & 1][j - 1][k]);
            }
    }

    int r = dp[n & 1][m][id[1]];
    cout << r << endl;
}

Compilation message

mobitel.cpp: In function 'void usaco(std::string)':
mobitel.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   30 |   freopen((s+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mobitel.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   31 |   freopen((s+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 130.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 3436 KB Output isn't correct
2 Correct 77 ms 3436 KB Output is correct
3 Incorrect 2053 ms 3052 KB Output isn't correct
4 Incorrect 2217 ms 3088 KB Output isn't correct
5 Incorrect 2194 ms 3092 KB Output isn't correct
6 Incorrect 2183 ms 3088 KB Output isn't correct
7 Incorrect 1042 ms 2284 KB Output isn't correct
8 Execution timed out 6078 ms 5996 KB Time limit exceeded
9 Execution timed out 6044 ms 8044 KB Time limit exceeded
10 Execution timed out 6036 ms 8172 KB Time limit exceeded