# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021176 | PieArmy | Election (BOI18_election) | C++17 | 324 ms | 46240 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.
typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}
struct Node{
int sum=0,pref=0,suf=0,ans=0;
};
struct Seg{
int n;
vector<Node>tree;
vector<int>arr;
Node comb(Node x,Node y){
Node res;
res.sum=x.sum+y.sum;
res.pref=max(x.pref,x.sum+y.pref);
res.suf=max(x.suf+y.sum,y.suf);
res.ans=max(max(x.ans+y.sum,x.sum+y.ans),x.pref+y.suf);
return res;
}
void build(int node=1,int left=0,int right=-1){
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... |