Submission #432473

#	Time	Username	Problem	Language	Result	Execution time	Memory
432473		Kevin_Zhang_TW	Horses (IOI15_horses)	C++17	17 / 100	1589 ms	12040 KiB

horses

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "horses.h"

const int MAX_N = 500010, p = 1e9 + 7;

ll dp[MAX_N];
int mu[MAX_N], se[MAX_N], n;
int init(int N, int X[], int Y[]) {
	n = N;
	copy(X, X+n, mu);
	copy(Y, Y+n, se);

	for (int i = n-1;i >= 0;--i) {
		dp[i] = max<ll>(se[i], mu[i+1] * dp[i+1]);
	}
	return dp[0] * mu[0] % p;
}

int updateX(int pos, int val) {	
	mu[pos] = val;
	for (int i = n-1;i >= 0;--i) {
		dp[i] = max<ll>(se[i], mu[i+1] * dp[i+1]);
	}
	return dp[0] * mu[0] % p;
}

int updateY(int pos, int val) {
	se[pos] = val;
	for (int i = n-1;i >= 0;--i) {
		dp[i] = max<ll>(se[i], mu[i+1] * dp[i+1]);
	}
	return dp[0] * mu[0] % p;
}

Compilation message (stderr)

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:31:23: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   31 |  return dp[0] * mu[0] % p;
      |         ~~~~~~~~~~~~~~^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:39:23: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   39 |  return dp[0] * mu[0] % p;
      |         ~~~~~~~~~~~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:47:23: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   47 |  return dp[0] * mu[0] % p;
      |         ~~~~~~~~~~~~~~^~~

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