제출 #988743

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988743		bigo	말 (IOI15_horses)	C++14	17 / 100	1559 ms	10444 KiB

horses

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <utility>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i,s,e) for(ll i=s;i<e;i++)
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll INF = 1e18;
typedef complex<double> cd;
const double pi = acos(-1);
const ll mod = 1e9 + 7;
const ll mod1 = 1e9 + 9;
const ll mod2 = 998244353;
const ll mac = 31;
const int MAXN = 4e5 + 2;
typedef vector<int> vi;
typedef vector<vi> vvi;
vi x, y;
int n;
int init(int N, int X[], int Y[]) {
	n = N;
	x.resize(n);
	y.resize(n);
	rep(i, 0, n) x[i] = X[i], y[i] = Y[i];
	ll ans = 1, cef = 1;
	rep(i, 0, n) {
		cef *= x[i];
		ans = max(ans, (cef * y[i]));
	}
	return ans%mod;
}

int updateX(int pos, int val) {
	x[pos] = val;
	ll ans = 1, cef = 1;
	rep(i, 0, n) {
		cef *= x[i];
		ans = max(ans, (cef * y[i]));
	}
	return ans % mod;
}

int updateY(int pos, int val) {
	y[pos] = val;
	ll ans = 1, cef = 1;
	rep(i, 0, n) {
		cef *= x[i];
		ans = max(ans, (cef * y[i]));
	}
	return ans % mod;
}
/*  
int main() {
	int n, q;
	cin >> n >> q;
	vector<int>x(n), y(n);
	rep(i, 0, n)
		cin >> x[i];
	rep(i, 0, n)
		cin >> y[i];
	cout<<
	while (q--) {
		int t, pos, val;
		cin >> t >> pos >> val
		if (t == 1) {
			cout<<
		}
		else {

		}
	}
}*/

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:32:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   32 |  return ans%mod;
      |         ~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:42:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   42 |  return ans % mod;
      |         ~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:52:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   52 |  return ans % mod;
      |         ~~~~^~~~~

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