Submission #140527

#	Time	Username	Problem	Language	Result	Execution time	Memory
140527		PedroBigMan	Horses (IOI15_horses)	C++14	17 / 100	1576 ms	28004 KiB

horses

//#include "horses.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
ll mod = 1000000007;
class PI;
vector<PI> lx,ly; 

class PI
{
    public:
    ll v[3];
    PI(ll x)
    {
        v[0]=0; v[1]=0; v[2]=x;
    }
    void R(ll x)
    {
        v[2]=x;
    }
};

PI Sum(PI A, PI B)
{
    PI ans(A.v[2]+B.v[2]);
    return ans;
}

PI Mul(PI A, PI B)
{
    PI ans(A.v[2]*B.v[2]);
    return ans;
}

PI Lar(PI A, PI B)
{
    PI ans(max(A.v[2],B.v[2]));
    return ans;
}

PI Div(PI A,PI B)
{
    PI ans((ll) A.v[2]/B.v[2]);
    return ans;
}

bool Eq(PI A, PI B)
{
    if(A.v[2]==B.v[2]) {return true;}
    return false;
}

int init(int N, int X[], int Y[]) 
{
    PI cur(0);
    REP(i,0,N)
    {
        cur.R(X[i]); lx.pb(cur);
        cur.R(Y[i]); ly.pb(cur);
    }
    PI am = Mul(lx[0],ly[0]);
    PI mx=am;
    REP(i,1,N)
    {
        am = Mul(am,Mul(ly[i],lx[i]));
        am = Div(am,ly[i-1]);
        mx = Lar(am,mx);
    }
    return mx.v[2];
}

int updateX(int pos, int val)
{	
    lx[pos].R(val);
    PI am = Mul(lx[0],ly[0]);
    PI mx=am;
    REP(i,1,lx.size())
    {
        am = Mul(am,Mul(ly[i],lx[i]));
        am = Div(am,ly[i-1]);
        mx = Lar(am,mx);
    }
    return mx.v[2];
}

int updateY(int pos, int val) 
{
    ly[pos].R(val);
    PI am = Mul(lx[0],ly[0]);
    PI mx=am;
    REP(i,1,lx.size())
    {
        am = Mul(am, Mul(ly[i],lx[i]));
        am = Div(am,ly[i-1]);
        mx = Lar(am,mx);
    }
    return mx.v[2];
}

/*int main()
{
    ll N; cin>>N; int X[N], Y[N];
    REP(i,0,N) {cin>>X[i]>>Y[i];}
    cout<<init(N,X,Y)<<endl;
}*/

Compilation message (stderr)

horses.cpp: In function 'void Out(std::vector<long long int>)':
horses.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
horses.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
horses.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:85:18: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     return mx.v[2];
            ~~~~~~^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
horses.cpp:93:9:
     REP(i,1,lx.size())
         ~~~~~~~~~~~~~            
horses.cpp:93:5: note: in expansion of macro 'REP'
     REP(i,1,lx.size())
     ^~~
horses.cpp:99:18: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     return mx.v[2];
            ~~~~~~^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
horses.cpp:107:9:
     REP(i,1,lx.size())
         ~~~~~~~~~~~~~            
horses.cpp:107:5: note: in expansion of macro 'REP'
     REP(i,1,lx.size())
     ^~~
horses.cpp:113:18: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     return mx.v[2];
            ~~~~~~^

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