# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283145 | laoriu | Split the sequence (APIO14_sequence) | C++14 | 117 ms | 131072 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.
#define X first
#define Y second
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
const int MAX=100005,MAX2=203,inf=2e9;
#define int long long
//typedef pair < ii , int > iii;
using ll = long long;
using ld = long double;
int n;
int a[MAX];
int f[MAX][MAX2];
using ps=pair < int , int >;
using line =pair < int , int >;
ps ii( int a,int b){
if(b<0) return ps(-a,-b);
else return ps(a,b);
}
bool cmp(ps a, ps b){
return a.X*b.Y<a.Y*b.X;
}
bool ss(ps a,int b){
return a.X<b*a.Y;
}
ps giao (line a,line b){
return ii(b.Y-a.Y,a.X-b.X);
}
vector < line > pr[MAX2];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |