# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113367 | kajebiii | Boat (APIO16_boat) | C++17 | 1808 ms | 15792 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<stdio.h>
#include<algorithm>
using namespace std;
#define MAXN 555
#define MOD 1000000007
long long inv[MAXN+1];
long long iCj[MAXN][MAXN], diCj[2*MAXN-1][MAXN+1];
long long g[MAXN][2*MAXN];
long long dp[MAXN+1][2*MAXN];
int main(){
int N;
int a[MAXN+1], b[MAXN+1];
int c[2*MAXN], cn=1;
int d[2*MAXN];
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d%d", a+i, b+i);
for(int i=1; i<=N; i++){
c[i*2-2]=a[i]-1;
c[i*2-1]=b[i];
}
sort(c, c+2*N);
for(int i=1; i<2*N; i++) if(c[i]!=c[i-1]) c[cn++]=c[i];
for(int i=1; i<cn; i++) d[i]=c[i]-c[i-1];
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... |