Submission #834054

#	Time	Username	Problem	Language	Result	Execution time	Memory
834054		Ellinor	Horses (IOI15_horses)	C++14	17 / 100	1559 ms	12172 KiB

horses

//#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <cstdlib>
#include <set>
#include <iomanip>
#include <limits>
#include <map>
#include <assert.h>
#include <algorithm>
#include <list>
#include <iterator>
#include <fstream>
#include <random>
#include <unordered_map>
#include <array>
using namespace std;

#define rep(i,a,b) for (int i = (a); i < b; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;

ll MOD = 1e9 + 7; // !?

// fast

#include "horses.h" // !

int n;
vector<ll> x, y;

int init(int N, int X[], int Y[]) 
{
    n = N;
    x.assign(N, 0);
    y.assign(N, 0);
    rep(i,0,N) {
        x[i] = X[i];
        y[i] = Y[i];
    }

    ll ans = 0;
    ll horses = 1;
    rep(i,0,n) {
        horses *= x[i];
        ans = max(ans, horses * y[i]);
    }

	return ans;
}

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

    ll ans = 0;
    ll horses = 1;
    rep(i,0,n) {
        horses *= x[i];
        ans = max(ans, horses * y[i]);
    }

	return ans;
}

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

    ll ans = 0;
    ll horses = 1;
    rep(i,0,n) {
        horses *= x[i];
        ans = max(ans, horses * y[i]);
    }

	return ans;
}

// 17p, M = 0

Compilation message (stderr)

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:54:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   54 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:68:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   68 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:82:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   82 |  return ans;
      |         ^~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23