# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566117 | birthdaycake | Election (BOI18_election) | C++17 | 379 ms | 26752 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>
#define endl '\n'
#define mod 1000000007
#define boost ios_base::sync_with_stdio(false), cin.tie(NULL);
using namespace std;
int N,Left,Right;
struct node{
int mxp, mxs, tot, ans;
};
node seg[2000001];
vector<node>ans;
void Query(int l = 1, int r = N, int ind = 1){
if(l > Right || r < Left) return;
if(l >= Left && r <= Right){
ans.push_back(seg[ind]);
return;
}
int mid = (l + r) /2;
Query(l, mid, ind * 2);
Query(mid + 1, r, ind * 2 + 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... |