# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45638 | gnoor | Boat (APIO16_boat) | C++17 | 2029 ms | 9696 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 <cstdio>
#include <algorithm>
#include <map>
using namespace std;
map<int,int> mp;
int a[600];
int b[600];
int mod=1000000007;
int dec[1010];
long long dp[600][1010];
long long p[32][600];
long long q[1010][600][32];
int main () {
int n;
scanf("%d",&n);
for (int i=0;i<n;i++) {
scanf("%d%d",&a[i],&b[i]);
mp[a[i]-1];
mp[b[i]];
}
int i=1;
for (auto &ii:mp) {
dec[i]=ii.first;
ii.second=i++;
}
for (int i=0;i<n;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... |