# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638649 | PoonYaPat | Boat (APIO16_boat) | C++14 | 2071 ms | 4292 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 mod=1e9+7;
int n,c[1001],st[501],ed[501],cnt;
ll dp[501][1001];
set<int> ss;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n;
for (int i=1; i<=n; ++i) {
cin>>st[i]>>ed[i]; --st[i];
ss.insert(st[i]);
ss.insert(ed[i]);
}
cnt=ss.size()-1;
int idx=0;
for (auto it=ss.begin(); it!=ss.end(); ++it) c[idx++]=*it;
for (int i=0; i<=cnt; ++i) dp[0][i]=1;
for (int i=1; i<=n; ++i) {
dp[i][0]=1; //don't send any boat
for (int j=1; j<=cnt; ++j) { //consider from the range from c[j-1]+1 to c[j]
dp[i][j]=dp[i][j-1];
int idx=0;
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... |