Submission #140518

#	Time	Username	Problem	Language	Result	Execution time	Memory
140518		PedroBigMan	Horses (IOI15_horses)	C++14	0 / 100	81 ms	20152 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;
int init(int N, int X[], int Y[]) 
{
    vector<ld> lx,ly; 
    REP(i,0,N) 
    {
        lx.pb((ld) log10(X[i]));
        ly.pb((ld) log10(Y[i]));
    }
    ll am = lx[0]+ly[0]; ll mx=am;
    REP(i,1,N)
    {
        am-=ly[i-1]; am+=ly[i]; am+= lx[i];
        mx=max(mx,am);
    }
    ll ans=1;
    while(mx>=1)
    {
        ans*=10; ans%=mod; mx=(ld) ((mx)-(ld) (1));
    }
    ans *= (ll) (pow(10,mx));
    ans%=mod;
    return ans;
}

int updateX(int pos, int val)
{	
	return 0;
}

int updateY(int pos, int val) 
{
	return 0;
}

/*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:30:18: warning: conversion to 'll {aka long long int}' from '__gnu_cxx::__alloc_traits<std::allocator<long double> >::value_type {aka long double}' may alter its value [-Wfloat-conversion]
     ll am = lx[0]+ly[0]; ll mx=am;
horses.cpp:33:19: warning: conversion to 'll {aka long long int}' from '__gnu_cxx::__alloc_traits<std::allocator<long double> >::value_type {aka long double}' may alter its value [-Wfloat-conversion]
         am-=ly[i-1]; am+=ly[i]; am+= lx[i];
                   ^
horses.cpp:33:30: warning: conversion to 'll {aka long long int}' from '__gnu_cxx::__alloc_traits<std::allocator<long double> >::value_type {aka long double}' may alter its value [-Wfloat-conversion]
         am-=ly[i-1]; am+=ly[i]; am+= lx[i];
                              ^
horses.cpp:33:42: warning: conversion to 'll {aka long long int}' from '__gnu_cxx::__alloc_traits<std::allocator<long double> >::value_type {aka long double}' may alter its value [-Wfloat-conversion]
         am-=ly[i-1]; am+=ly[i]; am+= lx[i];
                                          ^
horses.cpp:39:31: warning: conversion to 'll {aka long long int}' from 'ld {aka long double}' may alter its value [-Wfloat-conversion]
         ans*=10; ans%=mod; mx=(ld) ((mx)-(ld) (1));
                               ^~~~~~~~~~~~~~~~~~~~
horses.cpp:43:12: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     return ans;
            ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:46:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateX(int pos, int val)
                 ^~~
horses.cpp:46:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateX(int pos, int val)
                          ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:51:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateY(int pos, int val) 
                 ^~~
horses.cpp:51:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateY(int pos, int val) 
                          ^~~

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