# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112989 | CaroLinda | Rice Hub (IOI11_ricehub) | C++14 | 16 ms | 1920 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>
#include "ricehub.h"
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
const int inf = 1e9 + 10 ;
const int MAXN = 1e5 + 10 ;
using namespace std ;
int l , r , x[MAXN] ;
ll b ;
int pref[MAXN] , suf[MAXN] ;
int m(int a , int b)
{ return (a+b)/2 ; }
ll c1(int a , int b)
{ return pref[b] - pref[a-1] - (b-a+1) * x[a] ; }
ll c2(int a , int b)
{ return suf[a] - suf[b+1] - (b-a+1) * (l-x[b]) ; }
bool test(int tam)
# | 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... |