oj.uz

답안 #1090496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090496 2024-09-18T12:11:06 Z owoovo 말 (IOI15_horses) C++17
34 / 100
 1500 ms 78560 KB 
#include "horses.h"
#include<bits/stdc++.h>
#define ll long long
#define ld double
#define F first 
#define S second
#define lc id*2+1
#define rc id*2+2
using namespace std;
const ll p=1e9+7;
ll pw(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1)ans*=a,ans%=p;
		b>>=1,a*=a,a%=p;
	}
	return ans;
}
ll x[500010],y[500010],n;
ld x2[500010],y2[500010],u[500010];
struct BIT{
	ll ori[500010];
	void init(){
		for(int i=0;i<=n;i++)ori[i]=1;
		return;
	}
	void modify(ll x,int pos){
		while(pos<=n){
			ori[pos]*=x;
			ori[pos]%=p;
			pos+=pos&(-pos);
		}
		return;
	}
	ll query(ll pos){
		ll ans=1;
		while(pos){
			ans*=ori[pos];
			ans%=p;
			pos-=pos&(-pos);
		}
		return ans;
	}
}bit;
struct node{
	pair<ld,int> val;
	ld tag;
	node(){
	}
};
struct SEG_TREE{
	node ori[2000010];
	void pull(int l,int r,int id){
		if(l==r)return;
		ori[id].val=max(ori[lc].val,ori[rc].val);
		return;
	}
	void push(int l,int r,int id){
		ori[id].val.F+=ori[id].tag;
		if(l!=r){
			int m=(l+r)>>1;
			ori[lc].tag+=ori[id].tag;
			ori[rc].tag+=ori[id].tag;
			push(l,m,lc);
			push(m+1,r,rc);
			pull(l,r,id);
		}
		ori[id].tag=0;
		return;
	}
	void build(int l,int r,int id){
		ori[id].tag=0;
		if(l==r){
			ori[id].val={u[l],l};
			return;
		}
		int m=(l+r)>>1;
		build(l,m,lc);
		build(m+1,r,rc);
		pull(l,r,id);
		return;
	}
	void modify(int l,int r,int ml,int mr,int id,ld x){
		push(l,r,id);
		if(l==ml&&r==mr){
			ori[id].tag+=x;
			push(l,r,id);
			return;
		}
		int m=(l+r)>>1;
		if(mr<=m){
			modify(l,m,ml,mr,lc,x);
		}else if(m<ml){
			modify(m+1,r,ml,mr,rc,x);
		}else{
			modify(l,m,ml,m,lc,x);
			modify(m+1,r,m+1,mr,rc,x);
		}
		return;
	}
	pair<ld,int> query(int l,int r,int ql,int qr,int id){
		push(l,r,id);
		if(l==ql&&r==qr){
			return ori[id].val;
		}
		int m=(l+r)>>1;
		if(qr<=m){
			return query(l,m,ql,qr,lc);
		}else if(m<ql){
			return query(m+1,r,ql,qr,rc);
		}else{
			return max(query(l,m,ql,m,lc),query(m+1,r,m+1,qr,rc));
		}
	}
}seg;

ll q(){
	pair<ld,int> ans=seg.query(1,n,1,n,0);
	ll a=bit.query(ans.S);
	a*=y[ans.S];
	a%=p;
	return a;
}



int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=0;i<n;i++){
		x[i+1]=X[i];
		y[i+1]=Y[i];
	}
	bit.init();
	for(int i=1;i<=n;i++){
		x2[i]=log2(x[i]);
		y2[i]=log2(y[i]);
		bit.modify(x[i],i);
	}
	ld now=0;
	for(int i=1;i<=n;i++){	
		now+=x2[i];
		u[i]=now+y2[i];
	}
	seg.build(1,n,0);
	return q();
}

int updateX(int pos, int val) {	
	pos+=1;
	seg.modify(1,n,pos,n,0,log2(val)-log2(x[pos]));
	bit.modify((pw(x[pos],p-2)*val)%p,pos);
	x[pos]=val;
	return q();
}

int updateY(int pos, int val) {
	pos+=1;
	seg.modify(1,n,pos,pos,0,log2(val)-log2(y[pos]));
	y[pos]=val;
	return q();
}

Compilation message

horses.cpp: In member function 'void BIT::modify(long long int, int)':
horses.cpp:27:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   27 |  void modify(ll x,int pos){
      |                 ^
horses.cpp:19:4: note: shadowed declaration is here
   19 | ll x[500010],y[500010],n;
      |    ^
horses.cpp: In member function 'void SEG_TREE::modify(int, int, int, int, int, double)':
horses.cpp:83:50: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   83 |  void modify(int l,int r,int ml,int mr,int id,ld x){
      |                                                  ^
horses.cpp:19:4: note: shadowed declaration is here
   19 | ll x[500010],y[500010],n;
      |    ^
horses.cpp: In function 'long long int q()':
horses.cpp:118:31: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  118 |  pair<ld,int> ans=seg.query(1,n,1,n,0);
      |                               ^
horses.cpp:118:35: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  118 |  pair<ld,int> ans=seg.query(1,n,1,n,0);
      |                                   ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:144:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  144 |  seg.build(1,n,0);
      |              ^
horses.cpp:145:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  145 |  return q();
      |         ~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:150:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  150 |  seg.modify(1,n,pos,n,0,log2(val)-log2(x[pos]));
      |               ^
horses.cpp:150:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  150 |  seg.modify(1,n,pos,n,0,log2(val)-log2(x[pos]));
      |                     ^
horses.cpp:153:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  153 |  return q();
      |         ~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:158:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  158 |  seg.modify(1,n,pos,pos,0,log2(val)-log2(y[pos]));
      |               ^
horses.cpp:160:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  160 |  return q();
      |         ~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 47376 KB Output is correct
2 Correct 17 ms 47392 KB Output is correct
3 Correct 16 ms 47452 KB Output is correct
4 Correct 17 ms 47452 KB Output is correct
5 Correct 16 ms 47300 KB Output is correct
6 Correct 17 ms 47448 KB Output is correct
7 Correct 17 ms 47452 KB Output is correct
8 Correct 17 ms 47280 KB Output is correct
9 Correct 17 ms 47292 KB Output is correct
10 Correct 17 ms 47452 KB Output is correct
11 Correct 17 ms 47452 KB Output is correct
12 Correct 22 ms 47416 KB Output is correct
13 Correct 17 ms 47452 KB Output is correct
14 Correct 17 ms 47452 KB Output is correct
15 Correct 16 ms 47432 KB Output is correct
16 Correct 17 ms 47452 KB Output is correct
17 Correct 17 ms 47452 KB Output is correct
18 Correct 17 ms 47452 KB Output is correct
19 Correct 17 ms 47452 KB Output is correct
20 Correct 17 ms 47388 KB Output is correct
21 Correct 17 ms 47448 KB Output is correct
22 Correct 17 ms 47452 KB Output is correct
23 Correct 40 ms 47452 KB Output is correct
24 Correct 40 ms 47452 KB Output is correct
25 Correct 36 ms 47448 KB Output is correct
26 Correct 42 ms 47440 KB Output is correct
27 Correct 41 ms 47452 KB Output is correct
28 Correct 44 ms 47444 KB Output is correct
29 Correct 44 ms 47452 KB Output is correct
30 Correct 46 ms 47448 KB Output is correct
31 Correct 39 ms 47452 KB Output is correct
32 Correct 38 ms 47448 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1535 ms 76928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 47308 KB Output is correct
2 Correct 18 ms 47264 KB Output is correct
3 Correct 19 ms 47452 KB Output is correct
4 Correct 18 ms 47448 KB Output is correct
5 Correct 22 ms 47452 KB Output is correct
6 Correct 18 ms 47452 KB Output is correct
7 Correct 19 ms 47448 KB Output is correct
8 Correct 20 ms 47212 KB Output is correct
9 Correct 18 ms 47276 KB Output is correct
10 Correct 19 ms 47412 KB Output is correct
11 Correct 17 ms 47460 KB Output is correct
12 Correct 28 ms 47448 KB Output is correct
13 Correct 17 ms 47452 KB Output is correct
14 Correct 17 ms 47448 KB Output is correct
15 Correct 16 ms 47380 KB Output is correct
16 Correct 18 ms 47412 KB Output is correct
17 Correct 17 ms 47452 KB Output is correct
18 Correct 25 ms 47184 KB Output is correct
19 Correct 16 ms 47344 KB Output is correct
20 Correct 17 ms 47380 KB Output is correct
21 Correct 24 ms 47184 KB Output is correct
22 Correct 20 ms 47360 KB Output is correct
23 Correct 62 ms 47452 KB Output is correct
24 Correct 43 ms 47452 KB Output is correct
25 Correct 46 ms 47452 KB Output is correct
26 Correct 44 ms 47440 KB Output is correct
27 Correct 43 ms 47324 KB Output is correct
28 Correct 49 ms 47504 KB Output is correct
29 Correct 51 ms 47448 KB Output is correct
30 Correct 48 ms 47524 KB Output is correct
31 Correct 49 ms 47432 KB Output is correct
32 Correct 45 ms 47452 KB Output is correct
33 Execution timed out 1574 ms 78560 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 47448 KB Output is correct
2 Correct 25 ms 47452 KB Output is correct
3 Correct 19 ms 47452 KB Output is correct
4 Correct 19 ms 47580 KB Output is correct
5 Correct 17 ms 47452 KB Output is correct
6 Correct 22 ms 47212 KB Output is correct
7 Correct 19 ms 47448 KB Output is correct
8 Correct 24 ms 47416 KB Output is correct
9 Correct 25 ms 47408 KB Output is correct
10 Correct 24 ms 47356 KB Output is correct
11 Correct 19 ms 47448 KB Output is correct
12 Correct 18 ms 47452 KB Output is correct
13 Correct 21 ms 47452 KB Output is correct
14 Correct 18 ms 47272 KB Output is correct
15 Correct 19 ms 47452 KB Output is correct
16 Correct 25 ms 47196 KB Output is correct
17 Correct 20 ms 47436 KB Output is correct
18 Correct 18 ms 47388 KB Output is correct
19 Correct 20 ms 47188 KB Output is correct
20 Correct 20 ms 47452 KB Output is correct
21 Correct 18 ms 47452 KB Output is correct
22 Correct 18 ms 47452 KB Output is correct
23 Correct 48 ms 47452 KB Output is correct
24 Correct 64 ms 47452 KB Output is correct
25 Correct 37 ms 47440 KB Output is correct
26 Correct 48 ms 47452 KB Output is correct
27 Correct 64 ms 47440 KB Output is correct
28 Correct 45 ms 47356 KB Output is correct
29 Correct 48 ms 47452 KB Output is correct
30 Correct 45 ms 47448 KB Output is correct
31 Correct 42 ms 47452 KB Output is correct
32 Correct 41 ms 47448 KB Output is correct
33 Execution timed out 1514 ms 76884 KB Time limit exceeded
34 Halted 0 ms 0 KB -