# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101547 | doducanh | Split the sequence (APIO14_sequence) | C++14 | 85 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.
///breaker
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
#define mp make_pair
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define bit(x,i) ((x>>i)&1)
#define lc (id<<1)
#define rc ((id<<1)^1)
const int maxn=1e6+7;
ll dp[2][maxn];
int where[205][maxn];
ll a[maxn];
int n,k;
bool case1(int x, int y, int i) {
return (dp[0][y] - dp[0][x] >= (a[y] - a[x]) * (a[n] - a[i]));
}
bool case2(int x, int y, int i) {
return ((dp[0][y] - dp[0][x]) * (a[i] - a[y]) <=
(dp[0][i] - dp[0][y]) * (a[y] - a[x]));
}
void sol(void){
cin>>n>>k;
# | 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... |