| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 197744 | brcode | Relativnost (COCI15_relativnost) | C++14 | 3941 ms | 57448 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 <bits/stdc++.h>
using namespace std;
const long long MOD = 10007;
const long long MAXN = 1e5+5;
long long seg[4*MAXN][25];
long long n,c;
long long a[MAXN];
long long b[MAXN];
void build(long long curr,long long l,long long r){
if(l==r){
seg[curr][0] = b[l];
seg[curr][1] = a[l];
seg[curr][0]%=MOD;
seg[curr][1]%=MOD;
return;
}
long long mid = (l+r)/2;
build(2*curr,l,mid);
build(2*curr+1,mid+1,r);
for(long long i=0;i<=c;i++){
for(long long j=0;j<=c;j++){
seg[curr][min(i+j,c)] += (1LL*seg[2*curr][i]*seg[2*curr+1][j]);
seg[curr][min(i+j,c)]%=MOD;
}
}
}
void update(long long curr,long long l,long long r,long long target){
if(l==r){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||