# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624919 | QwertyPi | Boat (APIO16_boat) | C++14 | 1108 ms | 8656 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>
#define int long long
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
const int N = 520;
const int M = 1e9 + 7;
int a[N], b[N];
int d[N * 2];
int dp[2][N * 2][N];
int n, m;
int pm(int a, int b){
if(b == 0) return 1;
return pm(a * a % M, b / 2) * (b % 2 ? a : 1) % M;
}
int mi(int a){
return pm(a, M - 2);
}
int inv[N];
int32_t main(){
cin >> n;
for(int i = 0; i <= N; i++) inv[i] = mi(i);
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |