Submission #320980

#TimeUsernameProblemLanguageResultExecution timeMemory
320980zaneyuHorses (IOI15_horses)C++14
0 / 100
16 ms8556 KiB
/*input 3 2 1 3 3 4 1 1 2 1 2 */ #include "horses.h" #include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; #pragma GCC optimize("unroll-loops,no-stack-protector") //order_of_key #of elements less than x // find_by_order kth element typedef long long int ll; #define ld double #define pii pair<ll,ll> #define f first #define s second #define pb push_back #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(int i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() const ll maxn=5e3+5; const ll maxlg=__lg(maxn)+2; const ll INF64=4e18; const int INF=0x3f3f3f3f; const ll MOD=(1e9+7); const ll MOD2=1000002173; const ld PI=acos(-1); const ld eps=1e-9; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) #define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end())))) #define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin()) ll mult(ll a,ll b){ return ((a%MOD)*(b%MOD))%MOD; } ll mypow(ll a,ll b,ll MOD){ if(b<=0) return 1; ll res=1LL; while(b){ if(b&1) res=(res*a)%MOD; a=(a*a)%MOD; b>>=1; } return res; } ll y[maxn]; ld pref[maxn]; int x[maxn]; ld md=log2(MOD); multiset<ll> ms; int n; int init(int _n, int X[], int Y[]) { n=_n; REP1(i,n) pref[i]=pref[i-1]+(log2(X[i-1])),x[i]=X[i-1]; REP1(i,n) y[i]=Y[i-1]; ll ans=0; REP1(i,n){ while(pref[i]>=md) pref[i]-=md; MXTO(ans,mult(pow(2.0,pref[i]),y[i])); } return ans; } int updateX(int pos, int val) { x[pos+1]=val; REP1(i,n) pref[i]=pref[i-1]+(log2(x[i])); ll ans=0; REP1(i,n){ while(pref[i]>=md) pref[i]-=md; MXTO(ans,mult(pow(2.0,pref[i]),y[i])); } return ans; } int updateY(int pos, int val) { y[pos+1]=val; REP1(i,n) pref[i]=pref[i-1]+(log2(x[i])); ll ans=0; REP1(i,n){ while(pref[i]>=md) pref[i]-=md; //cout<<pow(2.0,pref[i])*y[i]<<'\n'; MXTO(ans,mult(pow(2.0,pref[i]),y[i])); } return ans; }

Compilation message (stderr)

horses.cpp: In function 'll mypow(ll, ll, ll)':
horses.cpp:46:26: warning: declaration of 'MOD' shadows a global declaration [-Wshadow]
   46 | ll mypow(ll a,ll b,ll MOD){
      |                          ^
horses.cpp:34:10: note: shadowed declaration is here
   34 | const ll MOD=(1e9+7);
      |          ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:69:20: warning: conversion from 'double' to 'll' {aka 'long long int'} may change value [-Wfloat-conversion]
   69 |   MXTO(ans,mult(pow(2.0,pref[i]),y[i]));
      |                 ~~~^~~~~~~~~~~~~
horses.cpp:40:42: note: in definition of macro 'MXTO'
   40 | #define MXTO(x,y) x=max(x,(__typeof__(x))y)
      |                                          ^
horses.cpp:71:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   71 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:81:20: warning: conversion from 'double' to 'll' {aka 'long long int'} may change value [-Wfloat-conversion]
   81 |   MXTO(ans,mult(pow(2.0,pref[i]),y[i]));
      |                 ~~~^~~~~~~~~~~~~
horses.cpp:40:42: note: in definition of macro 'MXTO'
   40 | #define MXTO(x,y) x=max(x,(__typeof__(x))y)
      |                                          ^
horses.cpp:83:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   83 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:93:20: warning: conversion from 'double' to 'll' {aka 'long long int'} may change value [-Wfloat-conversion]
   93 |   MXTO(ans,mult(pow(2.0,pref[i]),y[i]));
      |                 ~~~^~~~~~~~~~~~~
horses.cpp:40:42: note: in definition of macro 'MXTO'
   40 | #define MXTO(x,y) x=max(x,(__typeof__(x))y)
      |                                          ^
horses.cpp:95:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   95 |  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...