# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408947 | dxz05 | Horses (IOI15_horses) | C++14 | 404 ms | 157892 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 "horses.h"
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
const int MAXN = 2e6 + 3e2;
const int MOD = 1000000007;
int X[MAXN], Y[MAXN];
int N;
ll powmod(ll n, ll k){
if (k == 0) return 1;
ll x = powmod(n, k / 2);
x = x * x % MOD;
if (k % 2) x = x * n % MOD;
return x;
}
struct node{
ll mult = 1;
ld mx_sum = 0;
bool isUpdated = false;
ll mult_val = 1;
ld add_val = 0;
node(ll a1, ld a2, bool a3, ll a4, ld a5){
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... |