# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45142 | nibnalin | Three Friends (BOI14_friends) | C++17 | 1063 ms | 68276 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 <cstdio>
#include <vector>
using namespace std;
typedef long long int lli;
const lli maxn = lli(2e6)+5, MOD = lli(1e9)+11, charsz = 31;
lli n;
string S;
pair<lli, lli> st[4*maxn+10];
lli modpow(lli a, lli b)
{
if(!b) return 1ll;
else
{
lli res = modpow(a, b/2ll);
res *= res;
res %= MOD;
if(b%2) res *= a%MOD;
return res%MOD;
}
}
pair<lli, lli> combine(pair<lli, lli> a, pair<lli, lli> b)
{
pair<lli, lli> res = {a.first, a.second+b.second};
res.first += (b.first%MOD*modpow(charsz, a.second)%MOD)%MOD;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |