oj.uz

답안 #774140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774140 2023-07-05T12:19:18 Z shoryu386 Mobitel (COCI19_mobitel) C++17
0 / 130
 14 ms 6384 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define MAX 307
#define MOD 1000000007
int r, c, n;
unordered_map<int, int> smolbrain[MAX][MAX];
int arr[MAX][MAX];

inline int submod(int reeee){
	if (reeee >= MOD) return reeee-MOD;
	else return reeee;
}


main(){
	cin >> r >> c >> n;
	
	for (int x = 0; x < r; x++){ for (int y = 0; y < c; y++) cin >> arr[x][y];}
	
	smolbrain[0][0][arr[0][0]] = 1;
	
	int cringe[MAX][MAX];
	for (int x = 0; x < r; x++) cringe[x][0] = 1;
	for (int x = 0; x < c; x++) cringe[0][x] = 1;
	for (int y = 1; y < r; y++){
		for (int x = 1; x < c; x++){
			cringe[y][x] = submod(cringe[y-1][x] + cringe[y][x-1]);
		}
	}
	
	return 0;
	for (int y = 0; y < r; y++){
		for (int x = 0; x < c; x++){
			if (y < r-1){
				for (auto i : smolbrain[y][x]){
					if (i.first * arr[y+1][x] < n) smolbrain[y+1][x][ i.first * arr[y+1][x] ] = submod(smolbrain[y+1][x][ i.first * arr[y+1][x] ] + i.second); 
				}
			}
			
			if (x < c-1){
				for (auto i : smolbrain[y][x]){
					if (i.first * arr[y][x+1] < n) smolbrain[y][x+1][ i.first * arr[y][x+1] ] = submod(smolbrain[y][x+1][ i.first * arr[y][x+1] ] + i.second); 
				}
			}
		}
	}
	
	/*
	for (int y = 0; y < r; y++){
		for (int x = 0; x < c; x++){
			cout << "DEBUG FOR " << y << ' ' << x << '\n';
			for (auto i : smolbrain[y][x]){
				cout << i.first << ' ' << i.second << '\n';
			}
		}
	}
	* */
	
	int presum = 0;
	for (auto i : smolbrain[r-1][c-1]){
		presum = submod(presum + i.second);
	}
	
	cout << (cringe[r-1][c-1] - presum + MOD)%MOD;
}

Compilation message

mobitel.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main(){
      | ^~~~

Subtask #1
0 / 130.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 6356 KB Output isn't correct
2 Incorrect 14 ms 6384 KB Output isn't correct
3 Incorrect 4 ms 5716 KB Output isn't correct
4 Incorrect 4 ms 5716 KB Output isn't correct
5 Incorrect 4 ms 5716 KB Output isn't correct
6 Incorrect 4 ms 5608 KB Output isn't correct
7 Incorrect 5 ms 5588 KB Output isn't correct
8 Incorrect 11 ms 6084 KB Output isn't correct
9 Incorrect 14 ms 6380 KB Output isn't correct
10 Incorrect 14 ms 6356 KB Output isn't correct