oj.uz

답안 #17777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17777 2016-01-12T11:05:24 Z Adilkhan 힘 센 거북 (IZhO11_turtle) C++
40 / 100
 137 ms 82680 KB 
#include <bits/stdc++.h>

#define pb push_back
#define endl "\n"
#define mp make_pair 
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname ""
#define sz(x) (int)(x.size())

typedef long long ll;

using namespace std;

const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;

int n, m, a[2890000], d[2890000][21], z, k, t, x, y, sum; 

inline int cv(int x, int y) {
	return (x * (m + 1)) + y;
}

int main () {
	//freopen(fname".in", "r", stdin);
	//freopen(fname".out", "w", stdout);
	scanf("%d%d%d%d%d", &n, &m, &k, &t, &z);
	for (int i = 1; i <= k; ++i) {
	  scanf("%d%d", &x, &y);
		a[cv(x, y)] = 1;
	}       
	if (n * m >= 2890000) {
		assert(0);
	}
	d[cv(0, 0)][0] = 1;
	for (int i = 0; i <= n; ++i) {
		for (int j = 0; j <= m; ++j) {
			if (i == 0 && j == 0) continue;
			if (a[cv(i, j)] == 1) {
				for (int q = 1; q <= t; ++q) {
				 	if (i != 0)
						d[cv(i, j)][q] += d[cv(i - 1, j)][q - 1];
					if (j != 0)
						d[cv(i, j)][q] += d[cv(i, j - 1)][q - 1];
					d[cv(i, j)][q] %= z;
				}
			}else {
				for (int q = 0; q <= t; ++q) {
				  if (i != 0)
						d[cv(i, j)][q] += d[cv(i - 1, j)][q];
					if (j != 0)
						d[cv(i, j)][q] += d[cv(i, j - 1)][q];
					d[cv(i, j)][q] %= z;				
				}
			}	
		}
	}
	for (int i = 0; i <= t; ++i) {
		sum += d[cv(n, m)][i];
		sum %= z;
	} 
	printf("%d", sum);
	return 0;
}

Compilation message

turtle.cpp: In function 'int main()':
turtle.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d%d", &n, &m, &k, &t, &z);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
turtle.cpp:32:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &x, &y);
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 9 ms 2680 KB Output is correct
6 Correct 31 ms 20956 KB Output is correct
7 Correct 72 ms 33340 KB Output is correct
8 Correct 137 ms 82680 KB Output is correct
9 Runtime error 15 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 14 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 45 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 15 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 15 ms 460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 15 ms 404 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 15 ms 408 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 15 ms 476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 15 ms 476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 15 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 15 ms 380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 15 ms 476 KB Execution killed with signal 11 (could be triggered by violating memory limits)