oj.uz

답안 #781894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781894 2023-07-13T12:48:46 Z Lyrically 말 (IOI15_horses) C++17
17 / 100
 63 ms 37604 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
const int mod=1000000007;
int n;
struct node
{
	int ans,mul;
	double lgmul,lgans;
}seg[500005*4];
int x[500005],y[500005];
void upd(int id)
{
	seg[id].mul=seg[id*2].mul*seg[id*2+1].mul%mod;
	seg[id].lgmul=seg[id*2].lgmul+seg[id*2+1].lgmul;
	double fi=seg[id*2].lgans;
	double se=seg[id*2].lgmul+seg[id*2+1].lgans;
	if(fi>se)
	{
		seg[id].ans=seg[id*2].ans;
		seg[id].lgans=seg[id*2].lgans;
	}
	else
	{
		seg[id].ans=seg[id*2].mul*seg[id*2+1].ans%mod;
		seg[id].lgans=seg[id*2].lgmul+seg[id*2+1].lgans;
	}
}
void build(int id,int l,int r)
{
	if(l==r)
	{
		seg[id].ans=x[l]*y[l]%mod;
		seg[id].mul=x[l];
		seg[id].lgmul=log(x[l]);
		seg[id].lgans=log(x[l])+log(y[l]);
		return;
	}
	int mid=(l+r)/2;
	build(id*2,l,mid);build(id*2+1,mid+1,r);
	upd(id);
}
void change(int id,int l,int r,int pos,int val,int ty)
{
	if(l==r)
	{
		if(ty==0){x[l]=val;}
		else{y[l]=val;}
		seg[id].ans=x[l]*y[l]%mod;
		seg[id].mul=x[l];
		seg[id].lgmul=log(x[l]);
		seg[id].lgans=log(x[l])+log(y[l]);
		return;
	}
	int mid=(l+r)/2;
	if(pos<=mid){change(id*2,l,mid,pos,val,ty);}
	else{change(id*2+1,mid+1,r,pos,val,ty);}
	upd(id);
}
int init(int N,int X[],int Y[]){n=N;rep(i,n){x[i+1]=X[i];y[i+1]=Y[i];}build(1,1,n);return seg[1].ans;}
int updateX(int pos,int val){pos++;change(1,1,n,pos,val,0);return seg[1].ans;}
int updateY(int pos,int val){pos++;change(1,1,n,pos,val,1);return seg[1].ans;}

Compilation message

horses.cpp: In function 'int read()':
horses.cpp:7:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | int read(){int x;scanf("%d",&x);return x;}
      |                  ~~~~~^~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 37604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 23.0

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