# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153907 | arnold518 | 도넛 (JOI14_ho_t3) | C++14 | 241 ms | 4004 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int N;
ll A[MAXN+10], S;
bool decide(ll x)
{
int i, j;
int pa=0, pb=N-1;
ll suma=0, sumb=0;
vector<ll> SA(N), SB(N);
for(i=0; i<N; i++)
{
for(; suma<x; pa=(pa+1)%N) suma+=A[pa];
SA[i]=suma;
suma-=A[i];
}
for(i=N-1; i>=0; i--)
{
for(; sumb<x; pb=(pb+N-1)%N) sumb+=A[pb];
SB[i]=sumb;
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... |