oj.uz

Submission #28069

# Submission time Handle Problem Language Result Execution time Memory
28069 2017-07-15T07:23:43 Z top34051 Horses (IOI15_horses) C++14
34 / 100
 1043 ms 76264 KB 
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
#define maxn 500005
#define pdl pair<double,long long>
#define mod 1000000007LL

int n;
long long a[maxn];
long long b[maxn];
pdl tree[maxn*4];
pdl lazy[maxn*4];

pdl fus(pdl x,pdl y) {
    return {x.first+y.first,(x.second*y.second+mod)%mod};
}

long long inv(long long x,long long y) {
    long long quo,temp;
    long long oldr = x, r = y;
    long long olds = 1, s = 0;
    long long oldt = 0, t = 1;
    while(r) {
        quo = oldr/r;
        temp = oldr;
        oldr = r;
        r = temp-quo*r;
        temp = olds;
        olds = s;
        s = temp-quo*s;
        temp = oldt;
        oldt = t;
        t = temp-quo*t;
    }
    return (olds+mod)%mod;
}

void upd(int now) {
    tree[now] = fus(tree[now],lazy[now]);
    lazy[now<<1] = fus(lazy[now<<1],lazy[now]);
    lazy[now<<1|1] = fus(lazy[now<<1|1],lazy[now]);
    lazy[now] = {0,1};
}

void update(int now,int l,int r,int x,int y,double val1,long long val2) {
    upd(now);
    if(l>r || l>y || r<x) return ;
    if(x<=l && r<=y) {
        lazy[now] = {val1,val2};
        upd(now);
        return ;
    }
    int mid = (l+r)/2;
    update(now<<1,l,mid,x,y,val1,val2); update(now<<1|1,mid+1,r,x,y,val1,val2);
    tree[now] = max(tree[now<<1],tree[now<<1|1]);
}

void build(int now,int l,int r) {
    if(l==r) {
        tree[now] = lazy[now] = {0,1};
        return ;
    }
    int mid = (l+r)/2;
    build(now<<1,l,mid); build(now<<1|1,mid+1,r);
    tree[now] = lazy[now] = {0,1};
}

int init(int N, int X[], int Y[]) {
    n = N;
    for(int i=0;i<n;i++) a[i] = X[i], b[i] = Y[i];
    build(1,0,n-1);
    for(int i=0;i<n;i++) update(1,0,n-1,i,n-1,(double)log2(a[i]),a[i]);
    for(int i=0;i<n;i++) update(1,0,n-1,i,i,(double)log2(b[i]),b[i]);
	upd(1);
	return tree[1].second;
}

int updateX(int pos, int val) {
    update(1,0,n-1,pos,n-1,-(double)log2(a[pos]),inv(a[pos],mod));
    a[pos] = val;
	update(1,0,n-1,pos,n-1,(double)log2(a[pos]),a[pos]);
	upd(1);
	return tree[1].second;
}

int updateY(int pos, int val) {
    update(1,0,n-1,pos,pos,-(double)log2(b[pos]),inv(b[pos],mod));
    b[pos] = val;
	update(1,0,n-1,pos,pos,(double)log2(b[pos]),b[pos]);
	upd(1);
	return tree[1].second;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:75:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return tree[1].second;
                 ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:83:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return tree[1].second;
                 ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:91:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return tree[1].second;
                 ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 72352 KB Output is correct
2 Correct 0 ms 72352 KB Output is correct
3 Correct 0 ms 72352 KB Output is correct
4 Correct 0 ms 72352 KB Output is correct
5 Correct 0 ms 72352 KB Output is correct
6 Correct 0 ms 72352 KB Output is correct
7 Correct 0 ms 72352 KB Output is correct
8 Correct 0 ms 72352 KB Output is correct
9 Correct 0 ms 72352 KB Output is correct
10 Correct 0 ms 72352 KB Output is correct
11 Correct 0 ms 72352 KB Output is correct
12 Correct 0 ms 72352 KB Output is correct
13 Correct 0 ms 72352 KB Output is correct
14 Correct 0 ms 72352 KB Output is correct
15 Correct 0 ms 72352 KB Output is correct
16 Correct 0 ms 72352 KB Output is correct
17 Correct 0 ms 72352 KB Output is correct
18 Correct 0 ms 72352 KB Output is correct
19 Correct 0 ms 72352 KB Output is correct
20 Correct 0 ms 72352 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 72352 KB Output is correct
2 Correct 0 ms 72352 KB Output is correct
3 Correct 0 ms 72352 KB Output is correct
4 Correct 0 ms 72352 KB Output is correct
5 Correct 0 ms 72352 KB Output is correct
6 Correct 0 ms 72352 KB Output is correct
7 Correct 0 ms 72352 KB Output is correct
8 Correct 0 ms 72352 KB Output is correct
9 Correct 0 ms 72352 KB Output is correct
10 Correct 0 ms 72352 KB Output is correct
11 Correct 0 ms 72352 KB Output is correct
12 Correct 0 ms 72352 KB Output is correct
13 Correct 0 ms 72352 KB Output is correct
14 Correct 0 ms 72352 KB Output is correct
15 Correct 0 ms 72352 KB Output is correct
16 Correct 0 ms 72352 KB Output is correct
17 Correct 0 ms 72352 KB Output is correct
18 Correct 0 ms 72352 KB Output is correct
19 Correct 0 ms 72352 KB Output is correct
20 Correct 0 ms 72352 KB Output is correct
21 Correct 0 ms 72352 KB Output is correct
22 Correct 0 ms 72352 KB Output is correct
23 Correct 3 ms 72352 KB Output is correct
24 Correct 3 ms 72352 KB Output is correct
25 Correct 0 ms 72352 KB Output is correct
26 Correct 0 ms 72352 KB Output is correct
27 Correct 0 ms 72352 KB Output is correct
28 Correct 0 ms 72352 KB Output is correct
29 Correct 0 ms 72352 KB Output is correct
30 Correct 0 ms 72352 KB Output is correct
31 Correct 0 ms 72352 KB Output is correct
32 Correct 0 ms 72352 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1016 ms 76264 KB Output is correct
2 Incorrect 1043 ms 76264 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 72352 KB Output is correct
2 Correct 0 ms 72352 KB Output is correct
3 Correct 0 ms 72352 KB Output is correct
4 Correct 0 ms 72352 KB Output is correct
5 Correct 0 ms 72352 KB Output is correct
6 Correct 0 ms 72352 KB Output is correct
7 Correct 0 ms 72352 KB Output is correct
8 Correct 0 ms 72352 KB Output is correct
9 Correct 0 ms 72352 KB Output is correct
10 Correct 0 ms 72352 KB Output is correct
11 Correct 0 ms 72352 KB Output is correct
12 Correct 0 ms 72352 KB Output is correct
13 Correct 0 ms 72352 KB Output is correct
14 Correct 0 ms 72352 KB Output is correct
15 Correct 0 ms 72352 KB Output is correct
16 Correct 0 ms 72352 KB Output is correct
17 Correct 0 ms 72352 KB Output is correct
18 Correct 0 ms 72352 KB Output is correct
19 Correct 0 ms 72352 KB Output is correct
20 Correct 0 ms 72352 KB Output is correct
21 Correct 0 ms 72352 KB Output is correct
22 Correct 0 ms 72352 KB Output is correct
23 Correct 0 ms 72352 KB Output is correct
24 Correct 3 ms 72352 KB Output is correct
25 Correct 0 ms 72352 KB Output is correct
26 Correct 0 ms 72352 KB Output is correct
27 Correct 0 ms 72352 KB Output is correct
28 Correct 0 ms 72352 KB Output is correct
29 Correct 0 ms 72352 KB Output is correct
30 Correct 0 ms 72352 KB Output is correct
31 Correct 3 ms 72352 KB Output is correct
32 Correct 3 ms 72352 KB Output is correct
33 Incorrect 829 ms 76264 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 72352 KB Output is correct
2 Correct 0 ms 72352 KB Output is correct
3 Correct 0 ms 72352 KB Output is correct
4 Correct 0 ms 72352 KB Output is correct
5 Correct 0 ms 72352 KB Output is correct
6 Correct 0 ms 72352 KB Output is correct
7 Correct 0 ms 72352 KB Output is correct
8 Correct 0 ms 72352 KB Output is correct
9 Correct 0 ms 72352 KB Output is correct
10 Correct 0 ms 72352 KB Output is correct
11 Correct 0 ms 72352 KB Output is correct
12 Correct 0 ms 72352 KB Output is correct
13 Correct 0 ms 72352 KB Output is correct
14 Correct 0 ms 72352 KB Output is correct
15 Correct 0 ms 72352 KB Output is correct
16 Correct 0 ms 72352 KB Output is correct
17 Correct 0 ms 72352 KB Output is correct
18 Correct 0 ms 72352 KB Output is correct
19 Correct 0 ms 72352 KB Output is correct
20 Correct 0 ms 72352 KB Output is correct
21 Correct 0 ms 72352 KB Output is correct
22 Correct 0 ms 72352 KB Output is correct
23 Correct 0 ms 72352 KB Output is correct
24 Correct 0 ms 72352 KB Output is correct
25 Correct 0 ms 72352 KB Output is correct
26 Correct 0 ms 72352 KB Output is correct
27 Correct 0 ms 72352 KB Output is correct
28 Correct 0 ms 72352 KB Output is correct
29 Correct 0 ms 72352 KB Output is correct
30 Correct 3 ms 72352 KB Output is correct
31 Correct 0 ms 72352 KB Output is correct
32 Correct 0 ms 72352 KB Output is correct
33 Correct 956 ms 76264 KB Output is correct
34 Incorrect 1026 ms 76264 KB Output isn't correct
35 Halted 0 ms 0 KB -