Submission #572025

# Submission time Handle Problem Language Result Execution time Memory
572025 2022-06-03T11:06:31 Z beaconmc Horses (IOI15_horses) C++14
34 / 100
1500 ms 14400 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;

#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double

// #include "horses.h"
using namespace std;


vector<ll> x, y, xx, yy;
ll n;


int solve(){
	ll maxsum = 1;
	ll maxpos = -1;
	ll cur = 1;

	FOR(i,0,n){
		cur *= x[i];
		if (y[i] * cur >= maxsum){
			cur = 1;
			maxsum = y[i];
			maxpos = i;
		}
	}

	ll maxi = 1;
	FOR(i,0,maxpos+1){
		maxi *= x[i];
		maxi %= 1000000007;
	}
	


	return (maxi * maxsum) % 1000000007;

}

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

}

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

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

}



// int main(){
// 	ll n = 10;
// 	int x[10] = {10, 10, 10, 10, 10, 10, 1, 1, 1, 1};
// 	int y[10] = {1, 1, 1, 1, 9, 5, 4, 7, 3, 2};

// 	cout << init(n, x, y) << endl;

// 	cout << updateX(5, 1) << endl;
// 	cout << updateY(5, 123456789) << endl;
// 	cout << updateX(5, 1) << endl;
// 	cout << updateX(8, 987654321) << endl;


// }

Compilation message

horses.cpp: In function 'int solve()':
horses.cpp:39:25: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   39 |  return (maxi * maxsum) % 1000000007;
      |         ~~~~~~~~~~~~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 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 300 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 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 300 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 304 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 8 ms 340 KB Output is correct
24 Correct 8 ms 316 KB Output is correct
25 Correct 8 ms 340 KB Output is correct
26 Correct 7 ms 340 KB Output is correct
27 Correct 8 ms 340 KB Output is correct
28 Correct 8 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 7 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 5 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1584 ms 12260 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 8 ms 352 KB Output is correct
24 Correct 8 ms 340 KB Output is correct
25 Correct 6 ms 308 KB Output is correct
26 Correct 7 ms 312 KB Output is correct
27 Correct 6 ms 312 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 5 ms 312 KB Output is correct
33 Execution timed out 1547 ms 14308 KB Time limit exceeded
34 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 440 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 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 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 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 9 ms 312 KB Output is correct
24 Correct 8 ms 348 KB Output is correct
25 Correct 7 ms 340 KB Output is correct
26 Correct 7 ms 332 KB Output is correct
27 Correct 7 ms 340 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 7 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 5 ms 340 KB Output is correct
33 Execution timed out 1562 ms 14400 KB Time limit exceeded
34 Halted 0 ms 0 KB -