# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421167 | Pbezz | 말 (IOI15_horses) | C++14 | 1581 ms | 29888 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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ll MAXN=5e5+5;
const ll MOD=1e9+7;
int x[MAXN],y[MAXN],mini,n;
ll seg[4*MAXN];
//seg[node].second = 1 se ja ultrapassou 1e9+7
void recalculate(ll node){
ll res = seg[2*node+1]*seg[2*node+2];
res%=MOD;
seg[node] = res;
}
void build(ll node, ll left, ll right){
if(left==right){
seg[node] = (ll)x[left];
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... |