# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935033 | PagodePaiva | Horses (IOI15_horses) | C++17 | 55 ms | 22352 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>
#include "horses.h"
#define N 500010
using namespace std;
int n;
long long v[N][2];
long long dp[N];
const long long mod = 1e9+7;
long long p = 1;
long long binpow(long long a, long long b, long long m){
// cout << a << ' ';
a %= m;
if(b == 0) return 1;
long long t = binpow(a, b/2, m);
if(b % 2 == 0) return (t*t) % m;
else return ((((t*t) % m)*a) % m);
}
struct Segtree{
long long tree[4*N];
long long join(long long a, long long b){
return (a*b) % mod;
}
void build(int node, int l, int r){
if(l == r){
tree[node] = v[l][0];
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... |