# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
454739 | Josia | Fancy Fence (CEOI20_fancyfence) | C++17 | 537 ms | 27572 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 <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define int int64_t
vector<int> tree;
vector<bool> lazy;
map<int, int> dict;
vector<int> dictReverse;
int mod = 1000000007;
int calcOptions(int x) {
if (x%2) {
// cout << ((x+1)/2 * x)%mod << "blub\n";
return ((x+1)/2 * x)%mod;
} else {
return (x/2 * x + x/2)%mod;
}
}
void push(int v) {
if (v*2+1 >= tree.size()) return;
lazy[v*2] = lazy[v*2]||lazy[v];
lazy[v*2+1] = lazy[v*2+1]||lazy[v];
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... |