oj.uz

답안 #30829

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30829 2017-07-27T10:17:01 Z inqr 말 (IOI15_horses) C++14
17 / 100
 933 ms 72360 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
#define MAXN 500005
#define MOD (ll)1000000007
using namespace std;
int n;
int x[MAXN],y[MAXN];
pair<double,ll> st[4*MAXN];
pair<double,ll> lz[4*MAXN];
pair<double,ll> merge(pair<double,ll> a,pair<double,ll> b){
	return {a.st+b.st,(a.nd*b.nd+MOD)%MOD};
}
void lz_upd(int l,int r,int stp){
	st[stp]=merge(st[stp],lz[stp]);
	if(l!=r){
		lz[stp*2]=merge(lz[stp*2],lz[stp]);
		lz[stp*2+1]=merge(lz[stp*2+1],lz[stp]);
	}
	lz[stp]={0,1};
}
void upd(int ul,int ur,double uv1,ll uv2,int l,int r,int stp){
	if(l>r||ur<l||r<ul)return;
	lz_upd(l,r,stp);
	if(ul<=l&&r<=ur){
		lz[stp]={uv1,uv2};
		lz_upd(l,r,stp);
		return;
	}
	int m=(l+r)/2;
	upd(ul,ur,uv1,uv2,l,m,stp*2);upd(ul,ur,uv1,uv2,m+1,r,stp*2+1);
	st[stp]=max(st[stp*2],st[stp*2+1]);
}
void build(int l,int r,int stp){
	if(l>r)return;
	if(l==r){
		st[stp]=lz[stp]={0,1};
		return;
	}
	st[stp]=lz[stp]={0,1};
	int m=(l+r)/2;
	build(l,m,stp*2);build(m+1,r,stp*2+1);
}
ll invert(ll base){
	ll res=1;
	ll exp=MOD-2;
	while(exp>0){
		if(exp&1){
			res*=base;
			res%=MOD;
		}
		base*=base;
		base%=MOD;
		exp/=2;
	}
	return res;
}
int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=0;i<n;i++)x[i]=X[i],y[i]=Y[i];
	build(0,n-1,1);
	for(int i=0;i<n;i++){
		upd(i,n-1,(double)log2(x[i]),x[i],0,n-1,1);
		upd(i,i,(double)log2(y[i]),y[i],0,n-1,1);
	}
	return st[1].nd;
}
int updateX(int pos, int val){	
	upd(pos,n-1,-(double)log2(x[pos]),invert(x[pos]),0,n-1,1);
	x[pos]=val;
	upd(pos,n-1,(double)log2(x[pos]),x[pos],0,n-1,1);
	return st[1].nd;
}
int updateY(int pos, int val) {
	upd(pos,pos,-(double)log2(y[pos]),invert(y[pos]),0,n-1,1);
	y[pos]=val;
	upd(pos,pos,(double)log2(y[pos]),y[pos],0,n-1,1);
	return st[1].nd;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:7:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
 #define nd second
            ^
horses.cpp:76:15: note: in expansion of macro 'nd'
  return st[1].nd;
               ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:7:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
 #define nd second
            ^
horses.cpp:82:15: note: in expansion of macro 'nd'
  return st[1].nd;
               ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:7:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
 #define nd second
            ^
horses.cpp:88:15: note: in expansion of macro 'nd'
  return st[1].nd;
               ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 68448 KB Output is correct
2 Correct 0 ms 68448 KB Output is correct
3 Correct 0 ms 68448 KB Output is correct
4 Correct 0 ms 68448 KB Output is correct
5 Correct 0 ms 68448 KB Output is correct
6 Correct 0 ms 68448 KB Output is correct
7 Correct 0 ms 68448 KB Output is correct
8 Correct 0 ms 68448 KB Output is correct
9 Correct 0 ms 68448 KB Output is correct
10 Correct 0 ms 68448 KB Output is correct
11 Correct 0 ms 68448 KB Output is correct
12 Correct 0 ms 68448 KB Output is correct
13 Correct 0 ms 68448 KB Output is correct
14 Correct 0 ms 68448 KB Output is correct
15 Correct 0 ms 68448 KB Output is correct
16 Correct 0 ms 68448 KB Output is correct
17 Correct 0 ms 68448 KB Output is correct
18 Correct 0 ms 68448 KB Output is correct
19 Correct 0 ms 68448 KB Output is correct
20 Correct 0 ms 68448 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 68448 KB Output is correct
2 Correct 0 ms 68448 KB Output is correct
3 Correct 0 ms 68448 KB Output is correct
4 Correct 0 ms 68448 KB Output is correct
5 Correct 0 ms 68448 KB Output is correct
6 Correct 0 ms 68448 KB Output is correct
7 Correct 0 ms 68448 KB Output is correct
8 Correct 0 ms 68448 KB Output is correct
9 Correct 0 ms 68448 KB Output is correct
10 Correct 0 ms 68448 KB Output is correct
11 Correct 0 ms 68448 KB Output is correct
12 Correct 0 ms 68448 KB Output is correct
13 Correct 0 ms 68448 KB Output is correct
14 Correct 0 ms 68448 KB Output is correct
15 Correct 0 ms 68448 KB Output is correct
16 Correct 0 ms 68448 KB Output is correct
17 Correct 0 ms 68448 KB Output is correct
18 Correct 0 ms 68448 KB Output is correct
19 Correct 0 ms 68448 KB Output is correct
20 Correct 0 ms 68448 KB Output is correct
21 Correct 0 ms 68448 KB Output is correct
22 Incorrect 0 ms 68448 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 706 ms 72360 KB Output is correct
2 Incorrect 933 ms 72360 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 68448 KB Output is correct
2 Correct 0 ms 68448 KB Output is correct
3 Correct 0 ms 68448 KB Output is correct
4 Correct 0 ms 68448 KB Output is correct
5 Correct 0 ms 68448 KB Output is correct
6 Correct 0 ms 68448 KB Output is correct
7 Correct 0 ms 68448 KB Output is correct
8 Correct 0 ms 68448 KB Output is correct
9 Correct 0 ms 68448 KB Output is correct
10 Correct 0 ms 68448 KB Output is correct
11 Correct 0 ms 68448 KB Output is correct
12 Correct 0 ms 68448 KB Output is correct
13 Correct 0 ms 68448 KB Output is correct
14 Correct 0 ms 68448 KB Output is correct
15 Correct 0 ms 68448 KB Output is correct
16 Correct 0 ms 68448 KB Output is correct
17 Correct 0 ms 68448 KB Output is correct
18 Correct 0 ms 68448 KB Output is correct
19 Correct 0 ms 68448 KB Output is correct
20 Correct 0 ms 68448 KB Output is correct
21 Correct 0 ms 68448 KB Output is correct
22 Incorrect 0 ms 68448 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 68448 KB Output is correct
2 Correct 0 ms 68448 KB Output is correct
3 Correct 0 ms 68448 KB Output is correct
4 Correct 0 ms 68448 KB Output is correct
5 Correct 0 ms 68448 KB Output is correct
6 Correct 0 ms 68448 KB Output is correct
7 Correct 0 ms 68448 KB Output is correct
8 Correct 0 ms 68448 KB Output is correct
9 Correct 0 ms 68448 KB Output is correct
10 Correct 0 ms 68448 KB Output is correct
11 Correct 0 ms 68448 KB Output is correct
12 Correct 0 ms 68448 KB Output is correct
13 Correct 0 ms 68448 KB Output is correct
14 Correct 0 ms 68448 KB Output is correct
15 Correct 0 ms 68448 KB Output is correct
16 Correct 0 ms 68448 KB Output is correct
17 Correct 0 ms 68448 KB Output is correct
18 Correct 0 ms 68448 KB Output is correct
19 Correct 0 ms 68448 KB Output is correct
20 Correct 0 ms 68448 KB Output is correct
21 Correct 0 ms 68448 KB Output is correct
22 Incorrect 0 ms 68448 KB Output isn't correct
23 Halted 0 ms 0 KB -