oj.uz

답안 #649420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649420 2022-10-10T07:53:59 Z ToroTN 말 (IOI15_horses) C++14
17 / 100
 1500 ms 13708 KB 
#include<bits/stdc++.h>
using namespace std;
#include "horses.h"
#define ll long long
ll n,x[500005],y[500005],z[100005],node,ans,md=1000000007;
int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=1;i<=n;i++)
	{
		x[i]=X[i-1];
		y[i]=Y[i-1];
	}
	node=n;
	z[n]=y[n];
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

int updateX(int pos, int val) {
	pos+=1;
	x[pos]=val;
	z[n]=y[n];
	node=n;
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

int updateY(int pos, int val) {
	pos+=1;
	y[pos]=val;
	z[n]=y[n];
	node=n;
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:15:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   15 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:34:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   34 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:42:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   42 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:61:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   61 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:69:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   69 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:88:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   88 |  return ans;
      |         ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 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 304 KB Output is correct
13 Correct 1 ms 308 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 312 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 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 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 312 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 312 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 316 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 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 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 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -