# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628440 | abeker | Digital Circuit (IOI22_circuit) | C++17 | 1779 ms | 26912 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>
#include "circuit.h"
using namespace std;
const int MOD = 1e9 + 2022;
inline int add(int x, int y) {
x += y;
if (x >= MOD)
return x - MOD;
if (x < 0)
return x + MOD;
return x;
}
inline int mul(int x, int y) {
return (long long)x * y % MOD;
}
struct Node {
int tot, sum, lazy;
Node(int tot, int sum, int lazy) : tot(tot), sum(sum), lazy(lazy) {}
Node() : tot(0), sum(0), lazy(0) {}
};
class Tournament {
int m, offset;
vector <Node> tour;
public:
Node merge(Node lhs, Node rhs) {
# | 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... |