# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365327 | kostia244 | Election (BOI18_election) | C++17 | 1365 ms | 59676 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.
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
template<typename F>
void multitest(F func) {
int t;
cin >> t;
while(t--) func();
}
void report(int ok) {
cout << (ok?"YES":"NO") << '\n';
}
struct segtree {
struct node {
int mn, lazy;
node() : mn(0), lazy(0) {}
void apply(int x) {
mn += x, lazy += x;
}
void push(node &l, node &r) {
l.apply(lazy), r.apply(lazy), lazy = 0;
}
void build(node &l, node &r) {
mn = min(l.mn, r.mn);
assert(!lazy);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |