# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374729 | phathnv | 마스코트 (JOI13_mascots) | C++11 | 217 ms | 99820 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int R = 3007;
const int MOD = 1e9 + 7;
int r, c, n, dp[R][R], fact[R * R], nCk[R][R];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for(int i = 1; i < R * R; i++)
fact[i] = (ll) fact[i - 1] * i % MOD;
for(int i = 0; i < R; i++){
nCk[i][0] = 1;
for(int j = 1; j <= i; j++)
nCk[i][j] = (nCk[i - 1][j] + nCk[i - 1][j - 1]) % MOD;
}
cin >> r >> c >> n;
int minX = R, maxX = 0, minY = R, maxY = 0;
for(int i = 1; i <= n; i++){
int x, y;
cin >> x >> y;
minX = min(minX, x);
maxX = max(maxX, x);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |