oj.uz

답안 #17807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17807 2016-01-12T11:30:28 Z Adilkhan 힘 센 거북 (IZhO11_turtle) C++
40 / 100
 304 ms 165040 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())
#define int long long

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[2000002], d[2000002][21], z, k, t, x, y, sum; 

inline int cv(int X, int Y) {
	return (X * (m + 1ll)) + Y;
}

main () {
	//freopen(fname".in", "r", stdin);
	//freopen(fname".out", "w", stdout);
	scanf("%lld%lld%lld%lld%lld", &n, &m, &k, &t, &z);
	for (int i = 1; i <= k; ++i) {
	  scanf("%lld%lld", &x, &y);
		a[cv(x, y)] = 1;
	}       
	
	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("%lld", sum);
	return 0;
}

Compilation message

turtle.cpp:28:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
turtle.cpp: In function 'int main()':
turtle.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld%lld", &n, &m, &k, &t, &z);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
turtle.cpp:33:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld", &x, &y);
    ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 4 ms 988 KB Output is correct
5 Correct 13 ms 5112 KB Output is correct
6 Correct 185 ms 41604 KB Output is correct
7 Correct 150 ms 66440 KB Output is correct
8 Correct 304 ms 165040 KB Output is correct
9 Runtime error 38 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 19 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 19 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 19 ms 476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 19 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 20 ms 408 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 19 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 20 ms 500 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 19 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 19 ms 468 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 19 ms 408 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 19 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)