oj.uz

답안 #1018635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018635 2024-07-10T07:43:33 Z amirhoseinfar1385 말 (IOI15_horses) C++17
57 / 100
 1500 ms 65424 KB 
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=500000+10,mod=1e9+7,lg=20,kaf=(1<<(lg));
int allx[maxn],ally[maxn],n;
set<int>st;
struct segment{
	struct node{
		int maxa,zarb;
		node(){
			maxa=0;
			zarb=1;
		}
	};
	node seg[(1<<(lg+1))];
	void upd(int i,int w){
		i+=kaf;
		seg[i].zarb=seg[i].maxa=w;
		i>>=1;
		while(i>0){
			seg[i].maxa=max(seg[(i<<1)].maxa,seg[(i<<1)^1].maxa);
			seg[i].zarb=1ll*seg[(i<<1)].zarb*seg[(i<<1)^1].zarb%mod;
			i>>=1;
		}
	}
	int porszarb(int i,int l,int r,int tl,int tr){
		if(l>r||l>tr||r<tl||tl>tr){
			return 1;
		}
		if(l>=tl&&r<=tr){
			return seg[i].zarb;
		}
		int m=(l+r)>>1;
		return 1ll*porszarb((i<<1),l,m,tl,tr)*porszarb((i<<1)^1,m+1,r,tl,tr)%mod;
	}
	int porsmx(int i,int l,int r,int tl,int tr){
		if(l>r||l>tr||r<tl||tl>tr){
			return 0;
		}
		if(l>=tl&&r<=tr){
			return seg[i].maxa;
		}
		int m=(l+r)>>1;
		return max(porsmx((i<<1),l,m,tl,tr),porsmx((i<<1)^1,m+1,r,tl,tr));
	}
}segx,segy;
int calc(){
	long long unnow=1;
	vector<int>ind;
	while((int)st.size()>0){
		unnow*=allx[(*st.rbegin())];
		ind.push_back((*st.rbegin()));
		st.erase((*st.rbegin()));
		if(unnow>1000000000){
			break;
		}
	}
	unnow/=allx[ind.back()];
	long long mx=0;
	for(int i=0;i<(int)ind.size();i++){
		mx=max(mx,unnow*segy.porsmx(1,0,kaf-1,ind[i],n));
		unnow/=allx[ind[i]];
	}
	mx%=mod;
	mx*=segx.porszarb(1,0,kaf-1,0,ind.back());
	mx%=mod;
	for(auto x:ind){
		st.insert(x);
	}
	return mx;
}

int init(int N, int X[], int Y[]) {
	n=N;
	allx[0]=1;
	st.insert(0);
	for(int i=1;i<=n;i++){
		//cout<<i<<endl;
		allx[i]=X[i-1];
		segx.upd(i,allx[i]);
		ally[i]=Y[i-1];
		segy.upd(i,ally[i]);
		if(allx[i]>1){
			st.insert(i);
		}
	}
	return calc();
}

int updateX(int pos, int val) {
	pos++;	
	allx[pos]=val;
	if(allx[pos]==1){
		st.erase(pos);
	}else{
		st.insert(pos);
	}
	segx.upd(pos,val);
	return calc();
}

int updateY(int pos, int val) {
	pos++;
	ally[pos]=val;
	segy.upd(pos,val);
	return calc();
}

Compilation message

horses.cpp: In member function 'void segment::upd(int, int)':
horses.cpp:22:55: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   22 |    seg[i].zarb=1ll*seg[(i<<1)].zarb*seg[(i<<1)^1].zarb%mod;
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In member function 'int segment::porszarb(int, int, int, int, int)':
horses.cpp:34:71: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   34 |   return 1ll*porszarb((i<<1),l,m,tl,tr)*porszarb((i<<1)^1,m+1,r,tl,tr)%mod;
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int calc()':
horses.cpp:70:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   70 |  return mx;
      |         ^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35416 KB Output is correct
2 Correct 5 ms 35420 KB Output is correct
3 Correct 5 ms 35420 KB Output is correct
4 Correct 6 ms 35416 KB Output is correct
5 Correct 6 ms 35420 KB Output is correct
6 Correct 5 ms 35420 KB Output is correct
7 Correct 5 ms 35416 KB Output is correct
8 Correct 5 ms 35420 KB Output is correct
9 Correct 5 ms 35420 KB Output is correct
10 Correct 6 ms 35672 KB Output is correct
11 Correct 4 ms 35420 KB Output is correct
12 Correct 5 ms 35268 KB Output is correct
13 Correct 5 ms 35420 KB Output is correct
14 Correct 4 ms 35420 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 6 ms 35420 KB Output is correct
18 Correct 7 ms 35280 KB Output is correct
19 Correct 5 ms 35420 KB Output is correct
20 Correct 5 ms 35420 KB Output is correct
21 Correct 4 ms 35420 KB Output is correct
22 Correct 5 ms 35416 KB Output is correct
23 Correct 6 ms 35520 KB Output is correct
24 Correct 6 ms 35468 KB Output is correct
25 Correct 7 ms 35456 KB Output is correct
26 Correct 6 ms 35420 KB Output is correct
27 Correct 10 ms 35516 KB Output is correct
28 Correct 8 ms 35420 KB Output is correct
29 Correct 6 ms 35420 KB Output is correct
30 Correct 6 ms 35560 KB Output is correct
31 Correct 9 ms 35416 KB Output is correct
32 Correct 10 ms 35420 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35420 KB Output is correct
2 Correct 5 ms 35420 KB Output is correct
3 Correct 5 ms 35452 KB Output is correct
4 Correct 5 ms 35420 KB Output is correct
5 Correct 4 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 5 ms 35420 KB Output is correct
8 Correct 5 ms 35416 KB Output is correct
9 Correct 7 ms 35496 KB Output is correct
10 Correct 5 ms 35416 KB Output is correct
11 Correct 5 ms 35420 KB Output is correct
12 Correct 5 ms 35452 KB Output is correct
13 Correct 5 ms 35420 KB Output is correct
14 Correct 5 ms 35420 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 5 ms 35420 KB Output is correct
18 Correct 5 ms 35420 KB Output is correct
19 Correct 5 ms 35420 KB Output is correct
20 Correct 5 ms 35420 KB Output is correct
21 Correct 5 ms 35420 KB Output is correct
22 Correct 5 ms 35420 KB Output is correct
23 Correct 6 ms 35420 KB Output is correct
24 Correct 6 ms 35500 KB Output is correct
25 Correct 7 ms 35420 KB Output is correct
26 Correct 6 ms 35420 KB Output is correct
27 Correct 10 ms 35276 KB Output is correct
28 Correct 7 ms 35416 KB Output is correct
29 Correct 6 ms 35420 KB Output is correct
30 Correct 6 ms 35420 KB Output is correct
31 Correct 8 ms 35512 KB Output is correct
32 Correct 10 ms 35420 KB Output is correct
33 Correct 161 ms 41168 KB Output is correct
34 Correct 154 ms 41296 KB Output is correct
35 Correct 295 ms 64600 KB Output is correct
36 Correct 287 ms 64596 KB Output is correct
37 Correct 207 ms 41212 KB Output is correct
38 Correct 242 ms 53160 KB Output is correct
39 Correct 149 ms 41040 KB Output is correct
40 Correct 258 ms 64592 KB Output is correct
41 Correct 168 ms 41040 KB Output is correct
42 Correct 194 ms 41088 KB Output is correct
43 Correct 246 ms 64336 KB Output is correct
44 Correct 272 ms 64336 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35416 KB Output is correct
2 Correct 5 ms 35420 KB Output is correct
3 Correct 5 ms 35280 KB Output is correct
4 Correct 5 ms 35416 KB Output is correct
5 Correct 5 ms 35288 KB Output is correct
6 Correct 5 ms 35420 KB Output is correct
7 Correct 5 ms 35420 KB Output is correct
8 Correct 5 ms 35256 KB Output is correct
9 Correct 6 ms 35420 KB Output is correct
10 Correct 5 ms 35420 KB Output is correct
11 Correct 5 ms 35272 KB Output is correct
12 Correct 5 ms 35420 KB Output is correct
13 Correct 5 ms 35420 KB Output is correct
14 Correct 5 ms 35420 KB Output is correct
15 Correct 7 ms 35420 KB Output is correct
16 Correct 5 ms 35452 KB Output is correct
17 Correct 5 ms 35420 KB Output is correct
18 Correct 5 ms 35460 KB Output is correct
19 Correct 5 ms 35416 KB Output is correct
20 Correct 4 ms 35420 KB Output is correct
21 Correct 5 ms 35420 KB Output is correct
22 Correct 5 ms 35416 KB Output is correct
23 Correct 6 ms 35420 KB Output is correct
24 Correct 6 ms 35420 KB Output is correct
25 Correct 11 ms 35476 KB Output is correct
26 Correct 6 ms 35420 KB Output is correct
27 Correct 10 ms 35516 KB Output is correct
28 Correct 7 ms 35420 KB Output is correct
29 Correct 6 ms 35420 KB Output is correct
30 Correct 6 ms 35420 KB Output is correct
31 Correct 8 ms 35416 KB Output is correct
32 Correct 10 ms 35420 KB Output is correct
33 Execution timed out 1561 ms 65364 KB Time limit exceeded
34 Halted 0 ms 0 KB -