제출 #206123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206123		awlintqaa	말 (IOI15_horses)	C++14	0 / 100	21 ms	9976 KiB

horses

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "horses.h"
ll n ;
ll a[100009] , cost [100009];
ll bt ( int id ,int num , int val ) {
        val %= mod ;
        if ( id == n )return val;
        ll ans = 0 ;
        num *= a[id];
        ans = max ( ans , bt( id+1 , num ,val ) );
        ans = max ( ans , bt( id+1 , 1   , val + (num-1) * cost [id] ) );
        ans = max ( ans , bt( id+1 , 0   , val + num     * cost [id] ) );
        ans %= mod ;
        return ans ;
}
int init(int N, int X[], int Y[]) {
        n = N;
        for ( int i =0 ;i < n ;i ++ ) a[i]=X[i];
        for ( int i =0 ;i < n ;i ++ ) cost [i] = Y [i];
        return bt(0,1,0);
}
int updateX(int pos, int val) {
        return 0;
}

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

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'll bt(int, int, int)':
horses.cpp:33:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         val %= mod ;
         ~~~~^~~~~~
horses.cpp:36:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         num *= a[id];
         ~~~~^~~~~~~~
horses.cpp:38:48: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         ans = max ( ans , bt( id+1 , 1   , val + (num-1) * cost [id] ) );
                                            ~~~~^~~~~~~~~~~~~~~~~~~~~
horses.cpp:39:48: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         ans = max ( ans , bt( id+1 , 0   , val + num     * cost [id] ) );
                                            ~~~~^~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:47:18: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return bt(0,1,0);
                ~~^~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:49:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateX(int pos, int val) {
                 ^~~
horses.cpp:49:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateX(int pos, int val) {
                          ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:53:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateY(int pos, int val) {
                 ^~~
horses.cpp:53: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