oj.uz

답안 #1000210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000210 2024-06-17T05:39:16 Z jer033 말 (IOI15_horses) C++17
34 / 100
 1500 ms 12412 KB 
#include "horses.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const ll MOD = 1'000'000'007;
const ll INF = 1'000'000'006;

ll regmul(ll a, ll b)
{
	return (a*b)%MOD;
}

ll boundmul(ll a, ll b)
{
	return min(INF, a*b);
}

vector<int> x;
vector<int> y;
int n;

ll solve(int N)
{
	ll safe = x[0];
	ll bes = y[0];
	ll currmul = 1;
	for (int i=1; i<N; i++)
	{
		if (boundmul(boundmul(currmul, x[i]), y[i])>=bes)
		{
			safe = regmul(safe, currmul);
			safe = regmul(safe, x[i]);
			currmul = 1;
			bes = y[i];
		}
		else
		{
			currmul = boundmul(currmul, x[i]);
		}
	}
	return regmul(safe, bes);
}

int init(int N, int X[], int Y[]) {
	for (int i=0; i<N; i++)
	{
		x.push_back(X[i]);
		y.push_back(Y[i]);
	}
	n=N;
	return solve(n);
}

int updateX(int pos, int val) {	
	x[pos] = val;
	return solve(n);
}

int updateY(int pos, int val) {
	y[pos] = val;
	return solve(n);
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:51:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   51 |  return solve(n);
      |         ~~~~~^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:56:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   56 |  return solve(n);
      |         ~~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:61:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   61 |  return solve(n);
      |         ~~~~~^~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 356 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 352 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 4 ms 480 KB Output is correct
24 Correct 4 ms 476 KB Output is correct
25 Correct 10 ms 504 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 5 ms 480 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 9 ms 468 KB Output is correct
30 Correct 10 ms 352 KB Output is correct
31 Correct 3 ms 352 KB Output is correct
32 Correct 3 ms 352 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 10 ms 348 KB Output is correct
26 Correct 10 ms 492 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 9 ms 472 KB Output is correct
30 Correct 10 ms 480 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Execution timed out 1582 ms 12412 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 10 ms 348 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 9 ms 348 KB Output is correct
30 Correct 10 ms 480 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Execution timed out 1588 ms 10632 KB Time limit exceeded
34 Halted 0 ms 0 KB -