# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667270 | flappybird | Digital Circuit (IOI22_circuit) | C++17 | 1125 ms | 48880 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 "circuit.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000002022ll
#define MAX 201010
int N, M;
vector<int> adj[MAX], prt;
vector<ll> psum[MAX], ssum[MAX];
ll A[MAX];
ll ma[MAX];
ll mulall[MAX];
vector<int> ison;
ll f(ll& a) { a %= MOD, a += MOD, a %= MOD; return a; }
struct segtree {
vector<ll> tree, sum;
vector<int> lazy;
void init(int s, int e, int ind) {
if (s == e) {
sum[ind] = mulall[s];
if (ison[s]) tree[ind] = mulall[s];
return;
}
int m = (s + e) >> 1;
init(s, m, ind * 2);
init(m + 1, e, ind * 2 + 1);
sum[ind] = sum[ind * 2] + sum[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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |