# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299552 | gs18115 | Archery (IOI09_archery) | C++14 | 1222 ms | 11788 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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
const int mx=200010;
struct seg
{
struct node
{
int sum;
int mxl;
node(int v=0):sum(v),mxl(v){}
node(int sum,int mxl):sum(sum),mxl(mxl){}
node operator+(const node&x)
{
return node(sum+x.sum,max(mxl,sum+x.mxl));
}
}t[mx*4];
void init(int n,int s,int e,vector<int>&v)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |