# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420374 | InternetPerson10 | Crossing (JOI21_crossing) | C++17 | 1938 ms | 66672 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>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007;
vector<int> nums[3];
vector<int> anss[9];
vector<int> tar;
vector<pair<pair<int, int>, int>> qs;
bool good[300001];
ll pow3[300001][4], sum3[300001][4];
ll ha[9][4];
vector<ll> ps = {1000000007, 1000000009, 1000000021, 1000000033};
vector<int> combine(vector<int> v1, vector<int> v2) {
vector<int> v;
v.resize(v1.size());
for(int i = 0; i < v.size(); i++) v[i] = (6 - v1[i] - v2[i])%3;
return v;
}
struct segTree {
ll prime; int typ;
vector<ll> nums, ops;
int size = 1;
void init(int n, ll p, int t) {
while(size < n) size *= 2;
vector<ll>().swap(nums);
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... |