Submission #373612

#	Time	Username	Problem	Language	Result	Execution time	Memory
373612		teehandsome	Horses (IOI15_horses)	C++11	17 / 100	1587 ms	12588 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()

using namespace std;
using namespace __gnu_pbds;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using ll=long long;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

void _print(vector<pii> x) {cerr<<"["; for(auto e:x) cerr<<"{"<<e.first<<","<<e.second<<"} ,"; cerr<<"]";}
template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}
void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"]";
    dbg(T...);
}
#define debug(...) cerr<<"[\""<<#__VA_ARGS__<<"\"]: [",dbg(__VA_ARGS__);

vector<int> x,y;
int n;

const int md=INF;

int solve() {
    vector<int> dp(n,0);
    ll ans=0;
    ll cur=1;
    for(int i=0;i<n;i++) {
        cur*=x[i];
        ans=max(ans,cur*y[i]);
    }
    int res=ans%md;
    return res;
}

int init(int N, int X[], int Y[]) {
    n=N;
    for(int i=0;i<N;i++) {
        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();
}

Compilation message (stderr)

horses.cpp: In function 'int solve()':
horses.cpp:46:16: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   46 |     int res=ans%md;
      |             ~~~^~~

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