# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827198 | vjudge1 | Crossing (JOI21_crossing) | C++14 | 437 ms | 30356 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>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = (1 << 18), x = 5, mod = 1e9 + 7 ;
ll n, q, pw[N + 1], sum[2 * N + 1], ans[2 * N + 1], psh[2 * N + 1] ;
string sa, sb, sc, t ;
map<char, int> mp ;
map<ll, bool> us ;
void push(ll l, ll r, ll v)
{
if(!psh[v])
return ;
ll num = psh[v] ;
psh[v] &= 0 ;
ans[v] = (sum[v] * num) % mod ;
if(l == r)
return ;
psh[v * 2] = psh[v * 2 + 1] = num ;
}
void build(ll l, ll r, ll v)
{
if(l == r)
{
if(l >= t.size())
return ;
sum[v] = pw[l] ;
ans[v] = (pw[l] * mp[t[l]]) % mod ;
return ;
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... |