제출 #447947

#제출 시각아이디문제언어결과실행 시간메모리
447947KarliverHorses (IOI15_horses)C++14
0 / 100
19 ms9924 KiB
#include "horses.h" #include <bits/stdc++.h> #define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x) #define all(v) (v).begin(), (v).end() using namespace std; #define forn(i,n) for (int i = 0; i < (n); ++i) #define rforn(i, n) for(int i = (n) - 1;i >= 0;--i) using ll = long long; int mod = (ll)1e9 + 7; #define PI acos(-1) typedef pair<int, int> pairs; const int INF = 1e9 + 1; //const int N = 2e5 + 100; const double eps = 1e-7; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <typename XPAX> void ckma(XPAX &x, XPAX y) { x = (x < y ? y : x); } template <typename XPAX> void ckmi(XPAX &x, XPAX y) { x = (x > y ? y : x); } int n; int A[100000], B[100000]; int init(int N, int X[], int Y[]) { ll ans = 0; double d = 0.0; ll tot = 1; double g = 0.0; n = N; forn(i, N) { A[i] = X[i]; B[i] = Y[i]; tot *= A[i]; tot %= mod; g += log10(A[i]); if(g + log10(B[i]) > d) { d = g + log10(B[i]); ans = (tot * B[i]) % mod; } } return ans; } int updateX(int pos, int val) { A[pos] = val; ll ans = 0; double d = 0.0; ll tot = 1; double g = 0.0; forn(i, n) { tot *= A[i]; tot %= mod; g += (double)log10(A[i]); double ps = log10(B[i]); if(g + ps > d) { d = g + ps; ans = tot * B[i]; } } return ans % mod; } int updateY(int pos, int val) { B[pos] = val; ll ans = 0; double d = 0.0; ll tot = 1; double g = 0.0; forn(i, n) { tot *= A[i]; tot %= mod; g += (double)log10(A[i]); double ps = log10(B[i]); if(g + ps > d) { d = g + ps; ans = tot * B[i]; } } return ans % mod; return ans; }

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

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:53:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   53 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:76:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   76 |  return ans % mod;
      |         ~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:100:13: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  100 |  return ans % mod;
      |         ~~~~^~~~~
horses.cpp:101:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  101 |  return ans;
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...