Submission #830400

#TimeUsernameProblemLanguageResultExecution timeMemory
830400SupersonicHorses (IOI15_horses)C++14
17 / 100
224 ms59224 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; typedef unsigned long long ll; ll h[500001]; ll x[500001]; ll y[500001]; bool subtask3=1; int n; set<int, greater<int>> g1; ll tree[1048577]; pair<ll,int> ytree[1048577]; unordered_map<ll,int> ry; void modify(int k, int x) { k += n; tree[k] = x; for (k /= 2; k >= 1; k /= 2) { tree[k] = tree[2*k]*tree[2*k+1]; tree[k]%=((ll)1e9+7); } } pair<ll,int> pmax(pair<ll,int> a,pair<ll,int> b){ if(a>b) return a; return b; } ll prod(ll a, ll b) { a += n; b += n; ll s = 1; while (a <= b) { if (a%2 == 1) {s *= tree[a++];s%=((ll)1e9+7);} if (b%2 == 0) {s *= tree[b--];s%=((ll)1e9+7);} a /= 2; b /= 2; } return s; } void ymodify(int k, int x) { if(k>2*n)exit(1); k += n; ytree[k] = {x,k}; for (k /= 2; k >= 1; k /= 2) { ytree[k] = pmax(ytree[2*k],ytree[2*k+1]); ytree[k].first%=((ll)1e9+7); } } pair<ll,int> rmax(ll a,ll b){ if(b>2*n)exit(1); a += n; b += n; pair<ll,int> s = {0,0}; while (a <= b) { if (a%2 == 1) {s = pmax(s,ytree[a++]);} if (b%2 == 0) {s = pmax(s,ytree[b--]);} a /= 2; b /= 2; } return s; } int init(int N, int X[], int Y[]) { n=N; if(n<=1000)subtask3=0; for(int i=0;i<n;i++){ x[i]=X[i]; if(x[i]<2)subtask3=0; modify(i,x[i]); y[i]=Y[i]; ry[y[i]]=i; ymodify(i,y[i]); if(x[i]>1)g1.insert(i); } //if(subtask3)exit(1); //cout<<rmax(2,2)<<endl;; if(!subtask3){ ll mp=0;ll c=1; for(int i=1;i<n;i++){ c*=x[i]; if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;} } return (prod(0,mp)*y[mp])%((ll)1e9+7); } else{ ll mp=n-33;ll c=1; for(int i=n-32;i<n;i++){ c*=x[i]; if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;} } return (prod(0,mp)*y[mp])%((ll)1e9+7); } } int sc=500; int updateX(int pos, int val) { if(val==1&&g1.count(pos))g1.erase(pos); if(val>1)g1.insert(pos); x[pos]=val; sc--; if(g1.empty())exit(1); //if(sc==0){for(auto i:g1)if(x[i]==1)exit(1);for(int i=0;i<n;i++)if(x[i]==1&&g1.count(i))exit(1);sc=500;} modify(pos,val); ll c=x[0];ll mp=0; vector<int> vv;int cn=34; for(auto i:g1){vv.push_back(i);cn--;if(cn==0)break;} reverse(vv.begin(),vv.end()); for(int vvi=0;vvi<vv.size();vvi++){ int vi=vv[vvi]; int vni=n-1;if(vvi!=vv.size()-1)vni=vv[vvi+1]-1; int i=rmax(vi,vni).second; if(i>=n)exit(1); c*=x[vi]; if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;} } return (prod(0,mp)*y[mp])%((ll)1e9+7); } int updateY(int pos, int val) { y[pos]=val; ymodify(pos,val); ry[y[pos]]=pos; ll c=x[0];ll mp=0; vector<int> vv;int cn=34; for(auto i:g1){vv.push_back(i);cn--;if(cn==0)break;} reverse(vv.begin(),vv.end()); for(int vvi=0;vvi<vv.size();vvi++){ int vi=vv[vvi]; int vni=n-1;if(vvi!=vv.size()-1)vni=vv[vvi+1]-1; int i=rmax(vi,vni).second; if(i>=n)exit(1); c*=x[vi]; if(c>y[mp]||y[i]>y[mp]||c*y[i]>y[mp]){mp=i;c=1;} } return (prod(0,mp)*y[mp])%((ll)1e9+7); }

Compilation message (stderr)

horses.cpp: In function 'void modify(int, int)':
horses.cpp:14:24: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   14 | void modify(int k, int x) {
      |                    ~~~~^
horses.cpp:6:4: note: shadowed declaration is here
    6 | ll x[500001];
      |    ^
horses.cpp: In function 'void ymodify(int, int)':
horses.cpp:37:25: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   37 | void ymodify(int k, int x) {
      |                     ~~~~^
horses.cpp:6:4: note: shadowed declaration is here
    6 | ll x[500001];
      |    ^
horses.cpp: In function 'std::pair<long long unsigned int, int> rmax(ll, ll)':
horses.cpp:47:6: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
   47 |  if(b>2*n)exit(1);
      |     ~^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:65:15: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   65 |   modify(i,x[i]);
      |            ~~~^
horses.cpp:68:16: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   68 |   ymodify(i,y[i]);
      |             ~~~^
horses.cpp:80:28: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   80 |   return (prod(0,mp)*y[mp])%((ll)1e9+7);
      |          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
horses.cpp:88:28: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
   88 |   return (prod(0,mp)*y[mp])%((ll)1e9+7);
      |          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:106:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for(int vvi=0;vvi<vv.size();vvi++){
      |                 ~~~^~~~~~~~~~
horses.cpp:108:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |    int vni=n-1;if(vvi!=vv.size()-1)vni=vv[vvi+1]-1;
      |                   ~~~^~~~~~~~~~~~~
horses.cpp:114:28: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
  114 |   return (prod(0,mp)*y[mp])%((ll)1e9+7);
      |          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:126:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |   for(int vvi=0;vvi<vv.size();vvi++){
      |                 ~~~^~~~~~~~~~
horses.cpp:128:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |    int vni=n-1;if(vvi!=vv.size()-1)vni=vv[vvi+1]-1;
      |                   ~~~^~~~~~~~~~~~~
horses.cpp:134:28: warning: conversion from 'll' {aka 'long long unsigned int'} to 'int' may change value [-Wconversion]
  134 |   return (prod(0,mp)*y[mp])%((ll)1e9+7);
      |          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
#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...