# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696713 | socpite | Izbori (COCI22_izbori) | C++14 | 689 ms | 94176 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;
#define f first
#define s second
typedef long long ll;
typedef long double ld;
const int maxn = 4e5+5;
const int zr = 2e5+3;
const ll inf = 1e18+5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll s1[4*maxn], s2[4*maxn], sumid[4*maxn];
int lz[4*maxn], A[maxn];
pair<int, int> vec[maxn];
vector<int> pos[maxn];
int n;
vector<int> nd;
void build(int l = 1, int r = maxn-1, int id = 1){
if(l == r)sumid[id] = maxn - l;
else{
int mid = (l+r)>>1;
build(l, mid, id<<1);
build(mid+1, r, id<<1|1);
sumid[id] = sumid[id<<1] + sumid[id<<1|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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |