oj.uz

Submission #571824

# Submission time Handle Problem Language Result Execution time Memory
571824 2022-06-02T19:34:05 Z beaconmc Horses (IOI15_horses) C++14
0 / 100
 1500 ms 10948 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define ll int
#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;
ll n;

int init(int N, int X[], int Y[]) {
	n = N;
	x.push_back(X[0]);
	y.push_back(Y[0]);

	FOR(i,1,N){
		x.push_back(x[i-1] * X[i]);
		y.push_back(Y[i]);
	}
	ll maxi = -1;
	FOR(i,0,N){
		maxi = max(maxi, X[i] * Y[i]);
	}
	return maxi;
}

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

	FOR(i,pos+1,n){
		x[i] *= x[i-1];
	}
	ll maxi = -1;
	FOR(i,0, n){
		maxi = max(maxi, x[i] * y[i]);
	}
	return maxi;
}

int updateY(int pos, int val) {
	y[pos] = val;
	ll maxi = -1;
	FOR(i,0, n){
		maxi = max(maxi, x[i] * y[i]);
	}
	return maxi;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 300 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1566 ms 10948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -