# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585483 | socpite | Split the sequence (APIO14_sequence) | C++14 | 1303 ms | 91956 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;
#define f first
#define s second
typedef long long ll;
const int maxn = 1e5+5;
const int maxk = 205;
int n, k;
ll dp[maxn][2], A[maxn];
int ans[maxn];
int trace[maxn][maxk];
int md= 1;
struct pt{
ll x, y;
int id;
pt(){};
pt(ll a, ll b, int c = 0){
x = a;
y = b;
id = c;
}
pt rt(){
return pt(-y, x);
}
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... |