oj.uz

답안 #1017778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017778 2024-07-09T10:07:41 Z Muhammet 말 (IOI15_horses) C++17
0 / 100
 36 ms 40512 KB 
#include <bits/stdc++.h>
#include "horses.h"

using namespace std;

#define ll long long

const ll M = 1e9 + 7;

int n;

vector <int> a1, b1;

ll f(){
	vector <ll> a(1,0), b(1,0), p(1,1), mx(n+2,0);
	for(auto i : a1) a.push_back(i);
	for(auto i : b1) b.push_back(i);
	for(int i = 1; i <= n; i++){
		p[i] = p[i-1] * a[i];
	}
	for(int i = n; i >= 1; i--){
		mx[i] = max(mx[i+1], p[i] * b[i]);
	}
	int ind = 1;
	ll ans = 0, k = 0;
	for(int i = 1; i <= n; i++){
		if(p[i] * b[i] == mx[ind]){
			k = max(k,ans+((p[i] * (b[i])) / p[ind-1]));
			if(i == n) b[i]++;
			ans += ((p[i] * (b[i]-1)) / p[ind-1]);
			ind = i+1;
			ans %= M;
			k %= M;
		}
	}
	ans = max(ans,k);
	ans %= M;
	return ans;
}

int init(int N, int X[], int Y[]) {
	n = N;
	a1.resize(n);
	b1.resize(n);
	for(int i = 0; i < n; i++){
		a1[i] = X[i];
		b1[i] = Y[i];
	}
	return f();
}

int updateX(int pos, int val) {	
	a1[pos] = val;
	return f();
}

int updateY(int pos, int val) {
	b1[pos] = val;
	return f();
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:49:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   49 |  return f();
      |         ~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:54:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   54 |  return f();
      |         ~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:59:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   59 |  return f();
      |         ~^~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 36 ms 40512 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 0 ms 348 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -